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/egcd2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:22:03,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:22:03,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:22:03,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:22:03,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:22:03,850 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:22:03,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:22:03,853 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:22:03,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:22:03,856 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:22:03,857 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:22:03,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:22:03,858 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:22:03,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:22:03,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:22:03,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:22:03,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:22:03,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:22:03,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:22:03,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:22:03,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:22:03,868 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:22:03,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:22:03,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:22:03,872 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:22:03,873 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:22:03,873 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:22:03,874 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:22:03,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:22:03,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:22:03,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:22:03,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:22:03,876 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:22:03,877 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:22:03,878 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:22:03,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:22:03,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:22:03,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:22:03,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:22:03,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:22:03,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:22:03,882 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-08 03:22:03,896 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:22:03,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:22:03,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:22:03,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:22:03,898 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:22:03,898 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:22:03,898 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:22:03,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:22:03,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:22:03,899 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:22:03,899 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:22:03,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:22:03,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:22:03,899 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:22:03,900 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:22:03,900 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:22:03,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:22:03,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:22:03,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:22:03,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:22:03,901 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:22:03,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:22:03,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:22:03,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:22:03,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:22:03,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:22:03,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:22:03,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:22:03,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:22:03,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:22:03,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:22:03,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:22:03,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:22:03,946 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:22:03,947 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd2.c [2019-09-08 03:22:04,004 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3de6105/9433a0b35192486f9053d1a2307bec0d/FLAG7df33043e [2019-09-08 03:22:04,403 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:22:04,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd2.c [2019-09-08 03:22:04,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3de6105/9433a0b35192486f9053d1a2307bec0d/FLAG7df33043e [2019-09-08 03:22:04,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3de6105/9433a0b35192486f9053d1a2307bec0d [2019-09-08 03:22:04,771 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:22:04,773 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:22:04,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:22:04,774 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:22:04,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:22:04,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:22:04" (1/1) ... [2019-09-08 03:22:04,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b74a746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:04, skipping insertion in model container [2019-09-08 03:22:04,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:22:04" (1/1) ... [2019-09-08 03:22:04,789 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:22:04,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:22:05,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:22:05,022 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:22:05,045 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:22:05,062 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:22:05,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05 WrapperNode [2019-09-08 03:22:05,063 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:22:05,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:22:05,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:22:05,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:22:05,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,240 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,257 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (1/1) ... [2019-09-08 03:22:05,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:22:05,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:22:05,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:22:05,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:22:05,270 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (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-08 03:22:05,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:22:05,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:22:05,333 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 03:22:05,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:22:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:22:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:22:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 03:22:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 03:22:05,334 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:22:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:22:05,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:22:05,561 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:22:05,562 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 03:22:05,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:22:05 BoogieIcfgContainer [2019-09-08 03:22:05,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:22:05,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:22:05,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:22:05,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:22:05,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:22:04" (1/3) ... [2019-09-08 03:22:05,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4335fe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:22:05, skipping insertion in model container [2019-09-08 03:22:05,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:22:05" (2/3) ... [2019-09-08 03:22:05,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4335fe27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:22:05, skipping insertion in model container [2019-09-08 03:22:05,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:22:05" (3/3) ... [2019-09-08 03:22:05,594 INFO L109 eAbstractionObserver]: Analyzing ICFG egcd2.c [2019-09-08 03:22:05,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:22:05,632 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:22:05,657 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:22:05,699 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:22:05,700 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:22:05,700 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:22:05,700 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:22:05,700 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:22:05,700 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:22:05,700 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:22:05,701 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:22:05,701 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:22:05,719 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-09-08 03:22:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 03:22:05,724 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:05,725 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:05,727 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:05,733 INFO L82 PathProgramCache]: Analyzing trace with hash -558324168, now seen corresponding path program 1 times [2019-09-08 03:22:05,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:05,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:05,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:05,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:05,845 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-08 03:22:05,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:22:05,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 03:22:05,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 03:22:05,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 03:22:05,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 03:22:05,865 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-09-08 03:22:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:05,889 INFO L93 Difference]: Finished difference Result 49 states and 77 transitions. [2019-09-08 03:22:05,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 03:22:05,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 03:22:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:05,897 INFO L225 Difference]: With dead ends: 49 [2019-09-08 03:22:05,897 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 03:22:05,901 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-08 03:22:05,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 03:22:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-08 03:22:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 03:22:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2019-09-08 03:22:05,942 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2019-09-08 03:22:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:05,942 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2019-09-08 03:22:05,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 03:22:05,943 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2019-09-08 03:22:05,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-08 03:22:05,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:05,944 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:05,944 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:05,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:05,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1008536757, now seen corresponding path program 1 times [2019-09-08 03:22:05,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:05,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:05,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:05,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:05,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:05,956 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:05,956 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:05,956 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:05,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:05,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:22:05,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:06,032 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-08 03:22:06,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:22:06,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:22:06,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:22:06,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:22:06,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:22:06,039 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand 3 states. [2019-09-08 03:22:06,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:06,098 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-09-08 03:22:06,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:22:06,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-09-08 03:22:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:06,101 INFO L225 Difference]: With dead ends: 39 [2019-09-08 03:22:06,101 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 03:22:06,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:22:06,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 03:22:06,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2019-09-08 03:22:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-08 03:22:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-09-08 03:22:06,113 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 11 [2019-09-08 03:22:06,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:06,114 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-09-08 03:22:06,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:22:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-09-08 03:22:06,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 03:22:06,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:06,115 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:06,116 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:06,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:06,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1182801044, now seen corresponding path program 1 times [2019-09-08 03:22:06,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:06,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,126 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:06,126 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:06,127 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-08 03:22:06,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:06,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-08 03:22:06,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:06,192 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-08 03:22:06,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:22:06,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:22:06,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:22:06,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:22:06,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:22:06,196 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 5 states. [2019-09-08 03:22:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:06,277 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-09-08 03:22:06,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:22:06,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-08 03:22:06,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:06,280 INFO L225 Difference]: With dead ends: 37 [2019-09-08 03:22:06,280 INFO L226 Difference]: Without dead ends: 35 [2019-09-08 03:22:06,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-08 03:22:06,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-08 03:22:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2019-09-08 03:22:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 03:22:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-09-08 03:22:06,289 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 12 [2019-09-08 03:22:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:06,290 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-09-08 03:22:06,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:22:06,290 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-09-08 03:22:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 03:22:06,291 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:06,291 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:06,291 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:06,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:06,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2031293851, now seen corresponding path program 1 times [2019-09-08 03:22:06,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:06,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,300 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:06,301 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:06,301 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-08 03:22:06,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:06,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:22:06,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:22:06,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:22:06,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:22:06,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:22:06,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:22:06,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:22:06,376 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 5 states. [2019-09-08 03:22:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:06,443 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-09-08 03:22:06,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:22:06,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-09-08 03:22:06,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:06,447 INFO L225 Difference]: With dead ends: 45 [2019-09-08 03:22:06,447 INFO L226 Difference]: Without dead ends: 43 [2019-09-08 03:22:06,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-08 03:22:06,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-08 03:22:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-08 03:22:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-08 03:22:06,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-09-08 03:22:06,459 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 17 [2019-09-08 03:22:06,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:06,460 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-09-08 03:22:06,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:22:06,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-09-08 03:22:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 03:22:06,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:06,461 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:06,461 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash -71864628, now seen corresponding path program 1 times [2019-09-08 03:22:06,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:06,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:06,471 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:06,471 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-08 03:22:06,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:06,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:22:06,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:06,543 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-08 03:22:06,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:22:06,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:22:06,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:22:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:22:06,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:22:06,548 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 5 states. [2019-09-08 03:22:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:06,798 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2019-09-08 03:22:06,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:22:06,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-09-08 03:22:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:06,800 INFO L225 Difference]: With dead ends: 49 [2019-09-08 03:22:06,800 INFO L226 Difference]: Without dead ends: 47 [2019-09-08 03:22:06,801 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-08 03:22:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-08 03:22:06,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-08 03:22:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-08 03:22:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-09-08 03:22:06,830 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 22 [2019-09-08 03:22:06,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:06,831 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-09-08 03:22:06,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:22:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-09-08 03:22:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 03:22:06,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:06,832 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:06,832 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:06,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:06,833 INFO L82 PathProgramCache]: Analyzing trace with hash 954332139, now seen corresponding path program 1 times [2019-09-08 03:22:06,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:06,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:06,840 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:06,841 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:06,841 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:06,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:06,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 03:22:06,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:06,931 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:22:06,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:06,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-08 03:22:06,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:22:06,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:22:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:22:06,938 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 6 states. [2019-09-08 03:22:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:07,123 INFO L93 Difference]: Finished difference Result 74 states and 101 transitions. [2019-09-08 03:22:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:22:07,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-09-08 03:22:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:07,127 INFO L225 Difference]: With dead ends: 74 [2019-09-08 03:22:07,127 INFO L226 Difference]: Without dead ends: 72 [2019-09-08 03:22:07,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-08 03:22:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-08 03:22:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2019-09-08 03:22:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 03:22:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 81 transitions. [2019-09-08 03:22:07,149 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 81 transitions. Word has length 34 [2019-09-08 03:22:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:07,150 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 81 transitions. [2019-09-08 03:22:07,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:22:07,150 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 81 transitions. [2019-09-08 03:22:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-08 03:22:07,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:07,151 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:07,152 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:07,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:07,152 INFO L82 PathProgramCache]: Analyzing trace with hash 286726549, now seen corresponding path program 1 times [2019-09-08 03:22:07,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:07,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:07,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:07,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:07,162 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:07,163 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:07,163 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-08 03:22:07,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:07,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:22:07,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:22:07,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:07,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-08 03:22:07,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:22:07,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:22:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:22:07,257 INFO L87 Difference]: Start difference. First operand 62 states and 81 transitions. Second operand 5 states. [2019-09-08 03:22:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:07,367 INFO L93 Difference]: Finished difference Result 107 states and 151 transitions. [2019-09-08 03:22:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:22:07,368 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-09-08 03:22:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:07,370 INFO L225 Difference]: With dead ends: 107 [2019-09-08 03:22:07,370 INFO L226 Difference]: Without dead ends: 99 [2019-09-08 03:22:07,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:22:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-08 03:22:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2019-09-08 03:22:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-08 03:22:07,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 124 transitions. [2019-09-08 03:22:07,389 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 124 transitions. Word has length 36 [2019-09-08 03:22:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:07,389 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 124 transitions. [2019-09-08 03:22:07,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:22:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 124 transitions. [2019-09-08 03:22:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 03:22:07,391 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:07,391 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:07,391 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:07,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1803964113, now seen corresponding path program 1 times [2019-09-08 03:22:07,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:07,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:07,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:07,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:07,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:07,399 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:07,399 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:07,399 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) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:07,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:07,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 03:22:07,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:22:07,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:07,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-08 03:22:07,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:22:07,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:22:07,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:22:07,500 INFO L87 Difference]: Start difference. First operand 88 states and 124 transitions. Second operand 6 states. [2019-09-08 03:22:07,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:07,614 INFO L93 Difference]: Finished difference Result 133 states and 192 transitions. [2019-09-08 03:22:07,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:22:07,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-09-08 03:22:07,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:07,617 INFO L225 Difference]: With dead ends: 133 [2019-09-08 03:22:07,617 INFO L226 Difference]: Without dead ends: 130 [2019-09-08 03:22:07,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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-08 03:22:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-08 03:22:07,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-09-08 03:22:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-08 03:22:07,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2019-09-08 03:22:07,642 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 42 [2019-09-08 03:22:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:07,643 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2019-09-08 03:22:07,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:22:07,643 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2019-09-08 03:22:07,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 03:22:07,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:07,645 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:07,645 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:07,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1108781502, now seen corresponding path program 2 times [2019-09-08 03:22:07,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:07,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:07,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:07,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:07,653 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:07,653 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:07,654 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) [2019-09-08 03:22:07,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:07,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:22:07,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:07,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-08 03:22:07,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:22:07,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:07,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-08 03:22:07,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:22:07,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:22:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:22:07,817 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand 7 states. [2019-09-08 03:22:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:08,003 INFO L93 Difference]: Finished difference Result 139 states and 195 transitions. [2019-09-08 03:22:08,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:22:08,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-09-08 03:22:08,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:08,006 INFO L225 Difference]: With dead ends: 139 [2019-09-08 03:22:08,006 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 03:22:08,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:22:08,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 03:22:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-09-08 03:22:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-08 03:22:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 191 transitions. [2019-09-08 03:22:08,038 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 191 transitions. Word has length 47 [2019-09-08 03:22:08,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:08,038 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 191 transitions. [2019-09-08 03:22:08,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:22:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 191 transitions. [2019-09-08 03:22:08,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-08 03:22:08,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:08,048 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:08,049 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:08,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:08,049 INFO L82 PathProgramCache]: Analyzing trace with hash 183700266, now seen corresponding path program 2 times [2019-09-08 03:22:08,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:08,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:08,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:08,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:08,065 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:08,065 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:08,065 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-08 03:22:08,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:22:08,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:22:08,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:08,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 03:22:08,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 03:22:08,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:08,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-08 03:22:08,161 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:22:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:22:08,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:22:08,162 INFO L87 Difference]: Start difference. First operand 135 states and 191 transitions. Second operand 7 states. [2019-09-08 03:22:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:08,379 INFO L93 Difference]: Finished difference Result 198 states and 298 transitions. [2019-09-08 03:22:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:22:08,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-09-08 03:22:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:08,388 INFO L225 Difference]: With dead ends: 198 [2019-09-08 03:22:08,388 INFO L226 Difference]: Without dead ends: 196 [2019-09-08 03:22:08,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 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-08 03:22:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-08 03:22:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 169. [2019-09-08 03:22:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-09-08 03:22:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 249 transitions. [2019-09-08 03:22:08,435 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 249 transitions. Word has length 56 [2019-09-08 03:22:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:08,436 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 249 transitions. [2019-09-08 03:22:08,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:22:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 249 transitions. [2019-09-08 03:22:08,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-08 03:22:08,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:08,440 INFO L399 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:08,441 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:08,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1556128492, now seen corresponding path program 1 times [2019-09-08 03:22:08,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:08,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:08,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:08,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:08,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:08,461 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:08,461 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:08,461 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) [2019-09-08 03:22:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:08,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 03:22:08,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 03:22:08,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:08,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 03:22:08,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:22:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:22:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:22:08,695 INFO L87 Difference]: Start difference. First operand 169 states and 249 transitions. Second operand 9 states. [2019-09-08 03:22:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:09,042 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2019-09-08 03:22:09,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:22:09,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-09-08 03:22:09,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:09,045 INFO L225 Difference]: With dead ends: 205 [2019-09-08 03:22:09,045 INFO L226 Difference]: Without dead ends: 202 [2019-09-08 03:22:09,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:22:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-09-08 03:22:09,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2019-09-08 03:22:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-08 03:22:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 294 transitions. [2019-09-08 03:22:09,069 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 294 transitions. Word has length 58 [2019-09-08 03:22:09,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:09,070 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 294 transitions. [2019-09-08 03:22:09,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:22:09,070 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 294 transitions. [2019-09-08 03:22:09,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 03:22:09,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:09,071 INFO L399 BasicCegarLoop]: trace histogram [10, 9, 9, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:09,071 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:09,072 INFO L82 PathProgramCache]: Analyzing trace with hash 674447781, now seen corresponding path program 3 times [2019-09-08 03:22:09,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:09,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:09,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:09,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:09,078 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:09,078 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:09,078 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-08 03:22:09,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:09,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 03:22:09,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:09,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:22:09,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:09,153 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-09-08 03:22:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:22:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:22:09,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:22:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:22:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:22:09,158 INFO L87 Difference]: Start difference. First operand 200 states and 294 transitions. Second operand 5 states. [2019-09-08 03:22:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:09,257 INFO L93 Difference]: Finished difference Result 252 states and 366 transitions. [2019-09-08 03:22:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:22:09,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 03:22:09,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:09,263 INFO L225 Difference]: With dead ends: 252 [2019-09-08 03:22:09,263 INFO L226 Difference]: Without dead ends: 177 [2019-09-08 03:22:09,271 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:22:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-08 03:22:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 141. [2019-09-08 03:22:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-08 03:22:09,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 195 transitions. [2019-09-08 03:22:09,288 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 195 transitions. Word has length 67 [2019-09-08 03:22:09,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:09,289 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 195 transitions. [2019-09-08 03:22:09,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:22:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 195 transitions. [2019-09-08 03:22:09,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 03:22:09,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:09,290 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:09,290 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1094555945, now seen corresponding path program 3 times [2019-09-08 03:22:09,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:09,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:09,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:09,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:09,296 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:09,296 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:09,297 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-08 03:22:09,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:22:09,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 03:22:09,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:09,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 03:22:09,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:09,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2019-09-08 03:22:09,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:09,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-08 03:22:09,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:22:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:22:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:22:09,415 INFO L87 Difference]: Start difference. First operand 141 states and 195 transitions. Second operand 8 states. [2019-09-08 03:22:09,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:09,568 INFO L93 Difference]: Finished difference Result 151 states and 203 transitions. [2019-09-08 03:22:09,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:22:09,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-09-08 03:22:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:09,570 INFO L225 Difference]: With dead ends: 151 [2019-09-08 03:22:09,570 INFO L226 Difference]: Without dead ends: 149 [2019-09-08 03:22:09,571 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-08 03:22:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 143. [2019-09-08 03:22:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 03:22:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2019-09-08 03:22:09,586 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 78 [2019-09-08 03:22:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:09,587 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2019-09-08 03:22:09,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:22:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2019-09-08 03:22:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 03:22:09,588 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:09,588 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:09,588 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:09,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1897817939, now seen corresponding path program 2 times [2019-09-08 03:22:09,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:09,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:09,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:09,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:09,594 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:09,595 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:09,595 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-08 03:22:09,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:22:09,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:22:09,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:09,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-08 03:22:09,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:09,895 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:22:09,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:09,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:22:09,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:22:09,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:22:09,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:09,902 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand 10 states. [2019-09-08 03:22:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:10,319 INFO L93 Difference]: Finished difference Result 185 states and 256 transitions. [2019-09-08 03:22:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:22:10,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-09-08 03:22:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:10,322 INFO L225 Difference]: With dead ends: 185 [2019-09-08 03:22:10,322 INFO L226 Difference]: Without dead ends: 182 [2019-09-08 03:22:10,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:22:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-08 03:22:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 153. [2019-09-08 03:22:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-09-08 03:22:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 209 transitions. [2019-09-08 03:22:10,341 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 209 transitions. Word has length 80 [2019-09-08 03:22:10,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:10,341 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 209 transitions. [2019-09-08 03:22:10,341 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:22:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 209 transitions. [2019-09-08 03:22:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 03:22:10,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:10,342 INFO L399 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:10,343 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:10,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1613054346, now seen corresponding path program 3 times [2019-09-08 03:22:10,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:10,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:10,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:10,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:10,349 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:10,349 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:10,349 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-08 03:22:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:10,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-08 03:22:10,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:10,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:22:10,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:22:10,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:10,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-08 03:22:10,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:22:10,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:22:10,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:22:10,468 INFO L87 Difference]: Start difference. First operand 153 states and 209 transitions. Second operand 7 states. [2019-09-08 03:22:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:10,764 INFO L93 Difference]: Finished difference Result 185 states and 257 transitions. [2019-09-08 03:22:10,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:22:10,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-09-08 03:22:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:10,766 INFO L225 Difference]: With dead ends: 185 [2019-09-08 03:22:10,767 INFO L226 Difference]: Without dead ends: 177 [2019-09-08 03:22:10,769 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:22:10,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-08 03:22:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 156. [2019-09-08 03:22:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-08 03:22:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 212 transitions. [2019-09-08 03:22:10,787 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 212 transitions. Word has length 83 [2019-09-08 03:22:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:10,788 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 212 transitions. [2019-09-08 03:22:10,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:22:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 212 transitions. [2019-09-08 03:22:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 03:22:10,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:10,789 INFO L399 BasicCegarLoop]: trace histogram [14, 13, 13, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:10,790 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:10,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1805300380, now seen corresponding path program 1 times [2019-09-08 03:22:10,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:10,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:10,795 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:10,795 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:10,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:10,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:10,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-08 03:22:10,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:10,943 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:22:10,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:10,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-08 03:22:10,948 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:22:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:22:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:22:10,949 INFO L87 Difference]: Start difference. First operand 156 states and 212 transitions. Second operand 8 states. [2019-09-08 03:22:11,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:11,243 INFO L93 Difference]: Finished difference Result 219 states and 305 transitions. [2019-09-08 03:22:11,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:22:11,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-09-08 03:22:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:11,246 INFO L225 Difference]: With dead ends: 219 [2019-09-08 03:22:11,246 INFO L226 Difference]: Without dead ends: 216 [2019-09-08 03:22:11,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-08 03:22:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2019-09-08 03:22:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-09-08 03:22:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 298 transitions. [2019-09-08 03:22:11,286 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 298 transitions. Word has length 89 [2019-09-08 03:22:11,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:11,287 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 298 transitions. [2019-09-08 03:22:11,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:22:11,287 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 298 transitions. [2019-09-08 03:22:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 03:22:11,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:11,289 INFO L399 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:11,289 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:11,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:11,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2024795347, now seen corresponding path program 2 times [2019-09-08 03:22:11,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:11,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:11,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:11,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:11,309 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:11,309 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:11,310 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:11,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:11,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:22:11,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:11,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-08 03:22:11,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:11,651 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 28 proven. 37 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-09-08 03:22:11,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:11,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:22:11,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:22:11,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:22:11,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:11,665 INFO L87 Difference]: Start difference. First operand 213 states and 298 transitions. Second operand 10 states. [2019-09-08 03:22:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:12,208 INFO L93 Difference]: Finished difference Result 253 states and 349 transitions. [2019-09-08 03:22:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:22:12,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-09-08 03:22:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:12,212 INFO L225 Difference]: With dead ends: 253 [2019-09-08 03:22:12,212 INFO L226 Difference]: Without dead ends: 251 [2019-09-08 03:22:12,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:22:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-09-08 03:22:12,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 195. [2019-09-08 03:22:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-09-08 03:22:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 262 transitions. [2019-09-08 03:22:12,246 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 262 transitions. Word has length 94 [2019-09-08 03:22:12,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:12,247 INFO L475 AbstractCegarLoop]: Abstraction has 195 states and 262 transitions. [2019-09-08 03:22:12,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:22:12,247 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 262 transitions. [2019-09-08 03:22:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 03:22:12,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:12,250 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:12,250 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:12,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:12,250 INFO L82 PathProgramCache]: Analyzing trace with hash 804169810, now seen corresponding path program 4 times [2019-09-08 03:22:12,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:12,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:12,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:12,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:12,257 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:12,257 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:12,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:12,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:12,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:22:12,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:12,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-08 03:22:12,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:12,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:12,564 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 31 proven. 156 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked. [2019-09-08 03:22:12,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:12,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-08 03:22:12,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:22:12,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:22:12,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:22:12,570 INFO L87 Difference]: Start difference. First operand 195 states and 262 transitions. Second operand 14 states. [2019-09-08 03:22:13,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:13,249 INFO L93 Difference]: Finished difference Result 267 states and 383 transitions. [2019-09-08 03:22:13,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:22:13,250 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 102 [2019-09-08 03:22:13,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:13,252 INFO L225 Difference]: With dead ends: 267 [2019-09-08 03:22:13,252 INFO L226 Difference]: Without dead ends: 264 [2019-09-08 03:22:13,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:22:13,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-08 03:22:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2019-09-08 03:22:13,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-08 03:22:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 375 transitions. [2019-09-08 03:22:13,301 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 375 transitions. Word has length 102 [2019-09-08 03:22:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:13,301 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 375 transitions. [2019-09-08 03:22:13,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:22:13,302 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 375 transitions. [2019-09-08 03:22:13,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 03:22:13,303 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:13,303 INFO L399 BasicCegarLoop]: trace histogram [17, 16, 16, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:13,303 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:13,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:13,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1563777377, now seen corresponding path program 3 times [2019-09-08 03:22:13,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:13,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:13,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:13,309 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:13,309 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:13,309 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:13,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:22:13,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 03:22:13,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:13,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:22:13,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:13,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 81 proven. 32 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:22:13,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:13,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:22:13,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:22:13,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:22:13,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:13,440 INFO L87 Difference]: Start difference. First operand 260 states and 375 transitions. Second operand 10 states. [2019-09-08 03:22:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:13,775 INFO L93 Difference]: Finished difference Result 273 states and 386 transitions. [2019-09-08 03:22:13,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:22:13,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2019-09-08 03:22:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:13,787 INFO L225 Difference]: With dead ends: 273 [2019-09-08 03:22:13,787 INFO L226 Difference]: Without dead ends: 271 [2019-09-08 03:22:13,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:22:13,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-09-08 03:22:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 268. [2019-09-08 03:22:13,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-08 03:22:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 381 transitions. [2019-09-08 03:22:13,830 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 381 transitions. Word has length 103 [2019-09-08 03:22:13,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:13,831 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 381 transitions. [2019-09-08 03:22:13,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:22:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 381 transitions. [2019-09-08 03:22:13,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-08 03:22:13,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:13,833 INFO L399 BasicCegarLoop]: trace histogram [18, 17, 17, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:13,833 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:13,833 INFO L82 PathProgramCache]: Analyzing trace with hash 822393669, now seen corresponding path program 4 times [2019-09-08 03:22:13,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:13,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:13,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:13,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:13,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:13,838 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:13,839 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:13,839 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:13,867 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:13,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:22:13,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:13,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-08 03:22:13,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:13,995 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 70 proven. 105 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-09-08 03:22:14,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:14,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:22:14,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:22:14,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:22:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:14,007 INFO L87 Difference]: Start difference. First operand 268 states and 381 transitions. Second operand 10 states. [2019-09-08 03:22:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:14,285 INFO L93 Difference]: Finished difference Result 289 states and 398 transitions. [2019-09-08 03:22:14,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:22:14,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 111 [2019-09-08 03:22:14,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:14,288 INFO L225 Difference]: With dead ends: 289 [2019-09-08 03:22:14,288 INFO L226 Difference]: Without dead ends: 285 [2019-09-08 03:22:14,288 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:22:14,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-08 03:22:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 193. [2019-09-08 03:22:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-08 03:22:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 250 transitions. [2019-09-08 03:22:14,321 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 250 transitions. Word has length 111 [2019-09-08 03:22:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:14,321 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 250 transitions. [2019-09-08 03:22:14,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:22:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 250 transitions. [2019-09-08 03:22:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 03:22:14,323 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:14,323 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:14,323 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:14,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:14,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1081511953, now seen corresponding path program 5 times [2019-09-08 03:22:14,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:14,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:14,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:14,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:14,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:14,331 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:14,331 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:14,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:14,354 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 03:22:14,404 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-09-08 03:22:14,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:14,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-08 03:22:14,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 40 proven. 62 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2019-09-08 03:22:14,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:14,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-08 03:22:14,686 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:22:14,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:22:14,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:22:14,687 INFO L87 Difference]: Start difference. First operand 193 states and 250 transitions. Second operand 12 states. [2019-09-08 03:22:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:15,391 INFO L93 Difference]: Finished difference Result 253 states and 337 transitions. [2019-09-08 03:22:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:22:15,391 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 124 [2019-09-08 03:22:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:15,393 INFO L225 Difference]: With dead ends: 253 [2019-09-08 03:22:15,393 INFO L226 Difference]: Without dead ends: 250 [2019-09-08 03:22:15,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:22:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-08 03:22:15,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 203. [2019-09-08 03:22:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-09-08 03:22:15,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2019-09-08 03:22:15,425 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 124 [2019-09-08 03:22:15,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:15,426 INFO L475 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2019-09-08 03:22:15,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:22:15,426 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2019-09-08 03:22:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:22:15,429 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:15,429 INFO L399 BasicCegarLoop]: trace histogram [21, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:15,430 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:15,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1556105536, now seen corresponding path program 5 times [2019-09-08 03:22:15,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:15,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:15,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:15,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:15,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:15,435 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:15,435 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:15,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:15,455 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:15,524 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-08 03:22:15,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:15,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-08 03:22:15,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 80 proven. 24 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:22:15,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:15,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-08 03:22:15,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:22:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:22:15,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:22:15,590 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand 8 states. [2019-09-08 03:22:15,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:15,915 INFO L93 Difference]: Finished difference Result 220 states and 278 transitions. [2019-09-08 03:22:15,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:22:15,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2019-09-08 03:22:15,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:15,920 INFO L225 Difference]: With dead ends: 220 [2019-09-08 03:22:15,920 INFO L226 Difference]: Without dead ends: 218 [2019-09-08 03:22:15,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:22:15,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-09-08 03:22:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2019-09-08 03:22:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-09-08 03:22:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 273 transitions. [2019-09-08 03:22:15,952 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 273 transitions. Word has length 125 [2019-09-08 03:22:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:15,953 INFO L475 AbstractCegarLoop]: Abstraction has 215 states and 273 transitions. [2019-09-08 03:22:15,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:22:15,953 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 273 transitions. [2019-09-08 03:22:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:22:15,955 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:15,955 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:15,955 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:15,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1040748176, now seen corresponding path program 6 times [2019-09-08 03:22:15,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:15,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:15,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:15,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:15,961 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:15,961 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:15,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:15,978 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:16,010 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 03:22:16,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:16,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 03:22:16,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:16,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 107 proven. 32 refuted. 0 times theorem prover too weak. 1105 trivial. 0 not checked. [2019-09-08 03:22:16,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:16,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:22:16,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:22:16,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:22:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:22:16,148 INFO L87 Difference]: Start difference. First operand 215 states and 273 transitions. Second operand 10 states. [2019-09-08 03:22:16,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:16,437 INFO L93 Difference]: Finished difference Result 272 states and 355 transitions. [2019-09-08 03:22:16,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:22:16,437 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-09-08 03:22:16,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:16,439 INFO L225 Difference]: With dead ends: 272 [2019-09-08 03:22:16,439 INFO L226 Difference]: Without dead ends: 269 [2019-09-08 03:22:16,440 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:22:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-08 03:22:16,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 175. [2019-09-08 03:22:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-09-08 03:22:16,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 217 transitions. [2019-09-08 03:22:16,469 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 217 transitions. Word has length 146 [2019-09-08 03:22:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:16,470 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 217 transitions. [2019-09-08 03:22:16,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:22:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 217 transitions. [2019-09-08 03:22:16,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:22:16,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:16,473 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:16,474 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:16,474 INFO L82 PathProgramCache]: Analyzing trace with hash -218640321, now seen corresponding path program 6 times [2019-09-08 03:22:16,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:16,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:16,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:16,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:16,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:16,479 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:16,480 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:16,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:16,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:16,544 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 03:22:16,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:16,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-08 03:22:16,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:16,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 139 proven. 10 refuted. 0 times theorem prover too weak. 1107 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:22:16,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:16,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-08 03:22:16,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:22:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:22:16,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:22:16,627 INFO L87 Difference]: Start difference. First operand 175 states and 217 transitions. Second operand 7 states. [2019-09-08 03:22:16,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:16,725 INFO L93 Difference]: Finished difference Result 181 states and 222 transitions. [2019-09-08 03:22:16,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:22:16,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-08 03:22:16,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:16,727 INFO L225 Difference]: With dead ends: 181 [2019-09-08 03:22:16,727 INFO L226 Difference]: Without dead ends: 179 [2019-09-08 03:22:16,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:22:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-09-08 03:22:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-09-08 03:22:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-09-08 03:22:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 220 transitions. [2019-09-08 03:22:16,761 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 220 transitions. Word has length 147 [2019-09-08 03:22:16,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:16,762 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 220 transitions. [2019-09-08 03:22:16,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:22:16,762 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 220 transitions. [2019-09-08 03:22:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 03:22:16,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:16,764 INFO L399 BasicCegarLoop]: trace histogram [25, 24, 24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:16,764 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:16,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:16,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1300397831, now seen corresponding path program 7 times [2019-09-08 03:22:16,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:16,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:16,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:16,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:16,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:16,774 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:16,774 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:16,774 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:16,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:16,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 67 conjunts are in the unsatisfiable core [2019-09-08 03:22:16,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1249 backedges. 48 proven. 97 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2019-09-08 03:22:17,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:17,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-08 03:22:17,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:22:17,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:22:17,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:22:17,198 INFO L87 Difference]: Start difference. First operand 179 states and 220 transitions. Second operand 14 states. [2019-09-08 03:22:18,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:18,227 INFO L93 Difference]: Finished difference Result 240 states and 308 transitions. [2019-09-08 03:22:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:22:18,228 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2019-09-08 03:22:18,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:18,229 INFO L225 Difference]: With dead ends: 240 [2019-09-08 03:22:18,230 INFO L226 Difference]: Without dead ends: 237 [2019-09-08 03:22:18,230 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2019-09-08 03:22:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-08 03:22:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 189. [2019-09-08 03:22:18,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-09-08 03:22:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 234 transitions. [2019-09-08 03:22:18,267 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 234 transitions. Word has length 149 [2019-09-08 03:22:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:18,267 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 234 transitions. [2019-09-08 03:22:18,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:22:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 234 transitions. [2019-09-08 03:22:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:22:18,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:18,270 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:18,270 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1997061882, now seen corresponding path program 8 times [2019-09-08 03:22:18,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:18,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:18,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:18,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:18,277 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:18,277 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:18,277 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:18,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:18,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:22:18,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:18,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-08 03:22:18,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 56 proven. 133 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2019-09-08 03:22:18,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-09-08 03:22:18,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:22:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:22:18,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:22:18,729 INFO L87 Difference]: Start difference. First operand 189 states and 234 transitions. Second operand 15 states. [2019-09-08 03:22:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:19,768 INFO L93 Difference]: Finished difference Result 251 states and 323 transitions. [2019-09-08 03:22:19,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:22:19,769 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 171 [2019-09-08 03:22:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:19,770 INFO L225 Difference]: With dead ends: 251 [2019-09-08 03:22:19,771 INFO L226 Difference]: Without dead ends: 248 [2019-09-08 03:22:19,771 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:22:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-08 03:22:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 199. [2019-09-08 03:22:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-09-08 03:22:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 248 transitions. [2019-09-08 03:22:19,806 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 248 transitions. Word has length 171 [2019-09-08 03:22:19,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:19,806 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 248 transitions. [2019-09-08 03:22:19,806 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:22:19,807 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 248 transitions. [2019-09-08 03:22:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:22:19,809 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:19,809 INFO L399 BasicCegarLoop]: trace histogram [29, 28, 28, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:19,809 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:19,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1873117848, now seen corresponding path program 9 times [2019-09-08 03:22:19,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:19,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:19,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:19,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:19,818 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:19,819 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:19,819 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:19,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:22:19,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 03:22:19,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:19,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-08 03:22:19,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:22,160 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-08 03:22:24,207 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 25 [2019-09-08 03:22:24,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 201 proven. 100 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2019-09-08 03:22:24,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:24,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-08 03:22:24,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:22:24,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:22:24,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:22:24,332 INFO L87 Difference]: Start difference. First operand 199 states and 248 transitions. Second operand 14 states. [2019-09-08 03:22:26,958 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-09-08 03:22:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:26,984 INFO L93 Difference]: Finished difference Result 324 states and 420 transitions. [2019-09-08 03:22:26,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:22:26,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 171 [2019-09-08 03:22:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:26,986 INFO L225 Difference]: With dead ends: 324 [2019-09-08 03:22:26,986 INFO L226 Difference]: Without dead ends: 321 [2019-09-08 03:22:26,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-09-08 03:22:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-09-08 03:22:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2019-09-08 03:22:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-08 03:22:27,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 413 transitions. [2019-09-08 03:22:27,051 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 413 transitions. Word has length 171 [2019-09-08 03:22:27,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:27,051 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 413 transitions. [2019-09-08 03:22:27,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:22:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 413 transitions. [2019-09-08 03:22:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:22:27,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:27,054 INFO L399 BasicCegarLoop]: trace histogram [33, 32, 32, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:27,055 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1096608197, now seen corresponding path program 10 times [2019-09-08 03:22:27,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:27,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:27,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:27,061 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:27,061 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:27,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:27,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:27,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:22:27,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:27,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-08 03:22:27,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:27,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 66 proven. 432 refuted. 0 times theorem prover too weak. 1725 trivial. 0 not checked. [2019-09-08 03:22:27,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:27,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-09-08 03:22:27,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:22:27,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:22:27,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:22:27,597 INFO L87 Difference]: Start difference. First operand 318 states and 413 transitions. Second operand 18 states. [2019-09-08 03:22:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:28,786 INFO L93 Difference]: Finished difference Result 475 states and 647 transitions. [2019-09-08 03:22:28,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:22:28,786 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 193 [2019-09-08 03:22:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:28,790 INFO L225 Difference]: With dead ends: 475 [2019-09-08 03:22:28,790 INFO L226 Difference]: Without dead ends: 472 [2019-09-08 03:22:28,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2019-09-08 03:22:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2019-09-08 03:22:28,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 440. [2019-09-08 03:22:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 03:22:28,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 609 transitions. [2019-09-08 03:22:28,895 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 609 transitions. Word has length 193 [2019-09-08 03:22:28,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:28,896 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 609 transitions. [2019-09-08 03:22:28,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:22:28,896 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2019-09-08 03:22:28,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 03:22:28,900 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:28,900 INFO L399 BasicCegarLoop]: trace histogram [37, 36, 36, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:28,900 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:28,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:28,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1469442372, now seen corresponding path program 11 times [2019-09-08 03:22:28,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:28,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:28,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:28,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:28,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:28,906 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:28,906 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:28,906 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:28,925 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:29,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-09-08 03:22:29,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:29,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 83 conjunts are in the unsatisfiable core [2019-09-08 03:22:29,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2815 backedges. 97 proven. 402 refuted. 0 times theorem prover too weak. 2316 trivial. 0 not checked. [2019-09-08 03:22:29,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:29,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-09-08 03:22:29,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 03:22:29,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 03:22:29,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-09-08 03:22:29,728 INFO L87 Difference]: Start difference. First operand 440 states and 609 transitions. Second operand 21 states. [2019-09-08 03:22:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:31,160 INFO L93 Difference]: Finished difference Result 518 states and 730 transitions. [2019-09-08 03:22:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:22:31,160 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 215 [2019-09-08 03:22:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:31,163 INFO L225 Difference]: With dead ends: 518 [2019-09-08 03:22:31,164 INFO L226 Difference]: Without dead ends: 515 [2019-09-08 03:22:31,165 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2019-09-08 03:22:31,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-08 03:22:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 446. [2019-09-08 03:22:31,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-09-08 03:22:31,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 620 transitions. [2019-09-08 03:22:31,280 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 620 transitions. Word has length 215 [2019-09-08 03:22:31,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:31,281 INFO L475 AbstractCegarLoop]: Abstraction has 446 states and 620 transitions. [2019-09-08 03:22:31,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 03:22:31,281 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 620 transitions. [2019-09-08 03:22:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-08 03:22:31,285 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:31,286 INFO L399 BasicCegarLoop]: trace histogram [41, 40, 40, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:31,286 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1441747069, now seen corresponding path program 12 times [2019-09-08 03:22:31,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:31,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:31,295 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:31,295 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:31,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:22:31,313 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:31,481 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 03:22:31,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:31,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 76 conjunts are in the unsatisfiable core [2019-09-08 03:22:31,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:31,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3477 backedges. 227 proven. 337 refuted. 0 times theorem prover too weak. 2913 trivial. 0 not checked. [2019-09-08 03:22:31,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:31,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-08 03:22:31,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:22:31,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:22:31,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:22:31,801 INFO L87 Difference]: Start difference. First operand 446 states and 620 transitions. Second operand 14 states. [2019-09-08 03:22:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:32,354 INFO L93 Difference]: Finished difference Result 529 states and 745 transitions. [2019-09-08 03:22:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:22:32,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 237 [2019-09-08 03:22:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:32,357 INFO L225 Difference]: With dead ends: 529 [2019-09-08 03:22:32,357 INFO L226 Difference]: Without dead ends: 526 [2019-09-08 03:22:32,358 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:22:32,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-09-08 03:22:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 440. [2019-09-08 03:22:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-09-08 03:22:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 609 transitions. [2019-09-08 03:22:32,467 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 609 transitions. Word has length 237 [2019-09-08 03:22:32,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:32,468 INFO L475 AbstractCegarLoop]: Abstraction has 440 states and 609 transitions. [2019-09-08 03:22:32,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:22:32,468 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 609 transitions. [2019-09-08 03:22:32,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 03:22:32,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:32,471 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:32,471 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash -49942842, now seen corresponding path program 13 times [2019-09-08 03:22:32,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:32,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:32,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:32,478 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:32,478 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:32,478 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:32,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:22:32,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 87 conjunts are in the unsatisfiable core [2019-09-08 03:22:32,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:33,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4209 backedges. 88 proven. 337 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:22:33,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:33,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-09-08 03:22:33,346 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:22:33,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:22:33,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:22:33,346 INFO L87 Difference]: Start difference. First operand 440 states and 609 transitions. Second operand 19 states. [2019-09-08 03:22:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:35,498 INFO L93 Difference]: Finished difference Result 606 states and 848 transitions. [2019-09-08 03:22:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:22:35,499 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 259 [2019-09-08 03:22:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:35,502 INFO L225 Difference]: With dead ends: 606 [2019-09-08 03:22:35,502 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:22:35,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:22:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:22:35,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 592. [2019-09-08 03:22:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-08 03:22:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 833 transitions. [2019-09-08 03:22:35,686 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 833 transitions. Word has length 259 [2019-09-08 03:22:35,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:35,687 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 833 transitions. [2019-09-08 03:22:35,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:22:35,687 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 833 transitions. [2019-09-08 03:22:35,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 03:22:35,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:35,691 INFO L399 BasicCegarLoop]: trace histogram [45, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 8, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:35,691 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:35,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1905159983, now seen corresponding path program 14 times [2019-09-08 03:22:35,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:35,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:35,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:35,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:22:35,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:35,697 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:35,697 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:35,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:35,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:22:35,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:22:35,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:35,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 03:22:35,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:36,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:36,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4217 backedges. 88 proven. 345 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2019-09-08 03:22:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:36,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-09-08 03:22:36,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 03:22:36,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 03:22:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2019-09-08 03:22:36,433 INFO L87 Difference]: Start difference. First operand 592 states and 833 transitions. Second operand 20 states. [2019-09-08 03:22:38,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:22:38,437 INFO L93 Difference]: Finished difference Result 755 states and 1070 transitions. [2019-09-08 03:22:38,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:22:38,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 262 [2019-09-08 03:22:38,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:22:38,442 INFO L225 Difference]: With dead ends: 755 [2019-09-08 03:22:38,442 INFO L226 Difference]: Without dead ends: 752 [2019-09-08 03:22:38,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=89, Invalid=967, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:22:38,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-09-08 03:22:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 592. [2019-09-08 03:22:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-09-08 03:22:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 833 transitions. [2019-09-08 03:22:38,655 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 833 transitions. Word has length 262 [2019-09-08 03:22:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:22:38,656 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 833 transitions. [2019-09-08 03:22:38,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 03:22:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 833 transitions. [2019-09-08 03:22:38,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-08 03:22:38,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:22:38,665 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 12, 12, 12, 12, 12, 12, 12, 12, 12, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:22:38,665 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:22:38,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:22:38,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1085196165, now seen corresponding path program 15 times [2019-09-08 03:22:38,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:22:38,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:22:38,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:38,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:22:38,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:22:38,678 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:22:38,679 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:22:38,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:22:38,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:22:38,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-08 03:22:38,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:22:38,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-08 03:22:38,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:22:39,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:22:39,549 INFO L134 CoverageAnalysis]: Checked inductivity of 5011 backedges. 361 proven. 212 refuted. 0 times theorem prover too weak. 4438 trivial. 0 not checked. [2019-09-08 03:22:39,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:22:39,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-08 03:22:39,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:22:39,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:22:39,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:22:39,559 INFO L87 Difference]: Start difference. First operand 592 states and 833 transitions. Second operand 12 states. [2019-09-08 03:23:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:23:02,395 INFO L93 Difference]: Finished difference Result 912 states and 1297 transitions. [2019-09-08 03:23:02,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:23:02,395 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 281 [2019-09-08 03:23:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:23:02,401 INFO L225 Difference]: With dead ends: 912 [2019-09-08 03:23:02,401 INFO L226 Difference]: Without dead ends: 909 [2019-09-08 03:23:02,402 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:23:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-09-08 03:23:02,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 820. [2019-09-08 03:23:02,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 820 states. [2019-09-08 03:23:02,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1161 transitions. [2019-09-08 03:23:02,669 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1161 transitions. Word has length 281 [2019-09-08 03:23:02,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:23:02,670 INFO L475 AbstractCegarLoop]: Abstraction has 820 states and 1161 transitions. [2019-09-08 03:23:02,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:23:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1161 transitions. [2019-09-08 03:23:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-08 03:23:02,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:23:02,681 INFO L399 BasicCegarLoop]: trace histogram [49, 48, 48, 12, 12, 12, 12, 12, 12, 12, 12, 12, 9, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:23:02,681 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:23:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:23:02,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1513038638, now seen corresponding path program 16 times [2019-09-08 03:23:02,682 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:23:02,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:23:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:23:02,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:23:02,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:23:02,692 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:23:02,692 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:23:02,692 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:23:02,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:23:02,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 03:23:02,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:23:02,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 119 conjunts are in the unsatisfiable core [2019-09-08 03:23:02,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:23:03,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:23:03,415 INFO L134 CoverageAnalysis]: Checked inductivity of 5019 backedges. 160 proven. 978 refuted. 0 times theorem prover too weak. 3881 trivial. 0 not checked. [2019-09-08 03:23:03,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:23:03,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-09-08 03:23:03,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 03:23:03,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 03:23:03,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2019-09-08 03:23:03,419 INFO L87 Difference]: Start difference. First operand 820 states and 1161 transitions. Second operand 22 states. [2019-09-08 03:23:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:23:05,032 INFO L93 Difference]: Finished difference Result 1008 states and 1439 transitions. [2019-09-08 03:23:05,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:23:05,033 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 284 [2019-09-08 03:23:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:23:05,038 INFO L225 Difference]: With dead ends: 1008 [2019-09-08 03:23:05,039 INFO L226 Difference]: Without dead ends: 1005 [2019-09-08 03:23:05,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 261 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 03:23:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-09-08 03:23:05,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 984. [2019-09-08 03:23:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-09-08 03:23:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1414 transitions. [2019-09-08 03:23:05,367 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1414 transitions. Word has length 284 [2019-09-08 03:23:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:23:05,368 INFO L475 AbstractCegarLoop]: Abstraction has 984 states and 1414 transitions. [2019-09-08 03:23:05,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 03:23:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1414 transitions. [2019-09-08 03:23:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-08 03:23:05,374 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:23:05,374 INFO L399 BasicCegarLoop]: trace histogram [53, 52, 52, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:23:05,374 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:23:05,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:23:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1604370963, now seen corresponding path program 17 times [2019-09-08 03:23:05,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:23:05,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:23:05,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:23:05,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:23:05,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:23:05,382 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:23:05,382 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:23:05,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:23:05,399 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:23:06,998 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-08 03:23:06,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:23:07,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 101 conjunts are in the unsatisfiable core [2019-09-08 03:23:07,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:23:07,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:23:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5891 backedges. 204 proven. 683 refuted. 0 times theorem prover too weak. 5004 trivial. 0 not checked. [2019-09-08 03:23:07,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:23:07,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-09-08 03:23:07,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 03:23:07,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 03:23:07,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-09-08 03:23:07,960 INFO L87 Difference]: Start difference. First operand 984 states and 1414 transitions. Second operand 26 states. [2019-09-08 03:23:10,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:23:10,320 INFO L93 Difference]: Finished difference Result 1082 states and 1564 transitions. [2019-09-08 03:23:10,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 03:23:10,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 306 [2019-09-08 03:23:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:23:10,332 INFO L225 Difference]: With dead ends: 1082 [2019-09-08 03:23:10,332 INFO L226 Difference]: Without dead ends: 1079 [2019-09-08 03:23:10,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2019-09-08 03:23:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-09-08 03:23:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 994. [2019-09-08 03:23:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-09-08 03:23:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1428 transitions. [2019-09-08 03:23:10,570 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1428 transitions. Word has length 306 [2019-09-08 03:23:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:23:10,570 INFO L475 AbstractCegarLoop]: Abstraction has 994 states and 1428 transitions. [2019-09-08 03:23:10,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 03:23:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1428 transitions. [2019-09-08 03:23:10,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-09-08 03:23:10,576 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:23:10,576 INFO L399 BasicCegarLoop]: trace histogram [57, 56, 56, 14, 14, 14, 14, 14, 14, 14, 14, 14, 11, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:23:10,577 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:23:10,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:23:10,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2027868308, now seen corresponding path program 18 times [2019-09-08 03:23:10,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:23:10,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:23:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:23:10,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:23:10,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:23:10,584 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:23:10,584 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:23:10,584 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:23:10,601 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:23:13,205 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-09-08 03:23:13,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:23:13,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-08 03:23:13,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:23:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:23:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6833 backedges. 632 proven. 263 refuted. 0 times theorem prover too weak. 5938 trivial. 0 not checked. [2019-09-08 03:23:27,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:23:27,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-09-08 03:23:27,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:23:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:23:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=118, Unknown=6, NotChecked=0, Total=156 [2019-09-08 03:23:27,469 INFO L87 Difference]: Start difference. First operand 994 states and 1428 transitions. Second operand 13 states. [2019-09-08 03:23:31,543 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-08 03:24:28,941 WARN L188 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 03:24:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:24:28,982 INFO L93 Difference]: Finished difference Result 994 states and 1428 transitions. [2019-09-08 03:24:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:24:28,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 328 [2019-09-08 03:24:28,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:24:28,984 INFO L225 Difference]: With dead ends: 994 [2019-09-08 03:24:28,984 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 03:24:28,988 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=69, Invalid=222, Unknown=15, NotChecked=0, Total=306 [2019-09-08 03:24:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 03:24:28,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 03:24:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 03:24:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 03:24:28,989 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 328 [2019-09-08 03:24:28,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:24:28,990 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 03:24:28,990 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:24:28,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 03:24:28,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 03:24:28,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 03:24:31,263 WARN L188 SmtUtils]: Spent 2.26 s on a formula simplification. DAG size of input: 703 DAG size of output: 596 [2019-09-08 03:24:33,394 WARN L188 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 671 DAG size of output: 568 [2019-09-08 03:24:34,755 WARN L188 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 703 DAG size of output: 596 [2019-09-08 03:24:35,835 WARN L188 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 667 DAG size of output: 557 [2019-09-08 03:24:36,887 WARN L188 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 654 DAG size of output: 549 [2019-09-08 03:25:41,729 WARN L188 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 585 DAG size of output: 38 [2019-09-08 03:26:18,872 WARN L188 SmtUtils]: Spent 37.14 s on a formula simplification. DAG size of input: 556 DAG size of output: 38 [2019-09-08 03:27:50,056 WARN L188 SmtUtils]: Spent 1.52 m on a formula simplification. DAG size of input: 585 DAG size of output: 38 [2019-09-08 03:27:50,522 WARN L188 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 34 [2019-09-08 03:28:19,652 WARN L188 SmtUtils]: Spent 29.13 s on a formula simplification. DAG size of input: 543 DAG size of output: 38 [2019-09-08 03:30:47,112 WARN L188 SmtUtils]: Spent 2.46 m on a formula simplification. DAG size of input: 237 DAG size of output: 62 [2019-09-08 03:31:45,263 WARN L188 SmtUtils]: Spent 58.11 s on a formula simplification. DAG size of input: 536 DAG size of output: 38 [2019-09-08 03:31:45,285 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-08 03:31:45,285 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 03:31:45,285 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 03:31:45,285 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 03:31:45,285 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 03:31:45,286 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 03:31:45,286 INFO L439 ceAbstractionStarter]: At program point L35-2(lines 35 44) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) .cse1 (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-08 03:31:45,286 INFO L443 ceAbstractionStarter]: For program point L35-3(lines 35 44) no Hoare annotation was computed. [2019-09-08 03:31:45,286 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-09-08 03:31:45,286 INFO L439 ceAbstractionStarter]: At program point L29-2(lines 29 56) the Hoare annotation is: (let ((.cse3 (= main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))))) (let ((.cse1 (and .cse3 (<= (+ main_~b~0 1) main_~a~0))) (.cse0 (<= 1 main_~x~0)) (.cse2 (exists ((v_main_~q~0_50 Int) (v_main_~p~0_44 Int) (main_~k~0 Int) (main_~temp~0 Int) (v_main_~s~0_51 Int)) (and (= (+ main_~temp~0 (- (* v_main_~s~0_51 main_~k~0))) main_~s~0) (= (+ main_~b~0 (* main_~k~0 (+ (* v_main_~s~0_51 main_~y~0) (* v_main_~q~0_50 main_~x~0)))) (+ (* main_~y~0 main_~temp~0) (* v_main_~p~0_44 main_~x~0))) (= (+ v_main_~p~0_44 (- (* v_main_~q~0_50 main_~k~0))) main_~q~0))))) (or (and .cse0 .cse1 .cse2) (and (= main_~r~0 1) .cse0 .cse1 (= main_~p~0 0) (= main_~q~0 (+ (- (* main_~p~0 (* (- 1) main_~s~0))) 1)) .cse2) (and .cse3 (< main_~c~0 main_~b~0) (<= 1 main_~b~0) (= main_~r~0 0) (= main_~b~0 main_~y~0) (= main_~k~0 0) .cse0 (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2)))) [2019-09-08 03:31:45,286 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 56) the Hoare annotation is: (and (exists ((main_~p~0 Int) (main_~r~0 Int)) (= (let ((.cse0 (* (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)) (- 1)))) (+ (+ (+ (+ (* (+ (* 3 main_~p~0) main_~q~0) main_~x~0) (* (+ (* 3 main_~r~0) main_~s~0) main_~y~0)) .cse0) .cse0) .cse0)) main_~b~0)) (= main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (exists ((main_~p~0 Int) (main_~r~0 Int)) (= (let ((.cse1 (* (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)) (- 1)))) (+ (+ (+ (+ (* (+ (* 3 main_~p~0) main_~q~0) main_~x~0) (* (+ (* 3 main_~r~0) main_~s~0) main_~y~0)) .cse1) .cse1) .cse1)) 0)) (<= (+ main_~b~0 1) main_~a~0)) [2019-09-08 03:31:45,286 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 62) no Hoare annotation was computed. [2019-09-08 03:31:45,286 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 62) no Hoare annotation was computed. [2019-09-08 03:31:45,287 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-08 03:31:45,287 INFO L439 ceAbstractionStarter]: At program point L36(line 36) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) .cse1 (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-08 03:31:45,287 INFO L439 ceAbstractionStarter]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-08 03:31:45,287 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-09-08 03:31:45,287 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 62) the Hoare annotation is: true [2019-09-08 03:31:45,287 INFO L439 ceAbstractionStarter]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (<= 1 main_~x~0)) (.cse1 (<= (+ main_~b~0 1) main_~a~0))) (or (and (= main_~a~0 main_~y~0) (= main_~r~0 1) .cse0 (= main_~p~0 0)) (and (= main_~r~0 0) (= main_~p~0 1) .cse0 (= main_~a~0 main_~x~0) .cse1) (and (= main_~a~0 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0))) (exists ((main_~p~0 Int) (main_~r~0 Int)) (= (let ((.cse2 (* (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)) (- 1)))) (+ (+ (+ (+ (* (+ (* 3 main_~p~0) main_~q~0) main_~x~0) (* (+ (* 3 main_~r~0) main_~s~0) main_~y~0)) .cse2) .cse2) .cse2)) 0)) .cse1))) [2019-09-08 03:31:45,287 INFO L443 ceAbstractionStarter]: For program point L39(lines 35 44) no Hoare annotation was computed. [2019-09-08 03:31:45,287 INFO L439 ceAbstractionStarter]: At program point L37(line 37) the Hoare annotation is: (let ((.cse3 (+ (* main_~p~0 main_~x~0) (* main_~y~0 main_~r~0)))) (let ((.cse0 (= main_~b~0 (+ (* main_~y~0 main_~s~0) (* main_~q~0 main_~x~0)))) (.cse1 (<= 1 main_~x~0)) (.cse2 (= .cse3 (+ main_~c~0 (* main_~b~0 main_~k~0))))) (or (and (and (= main_~p~0 1) .cse0 (= main_~b~0 main_~y~0) .cse1 (= main_~x~0 (+ (* main_~k~0 main_~y~0) main_~c~0))) (= main_~q~0 0) (= main_~a~0 main_~x~0) .cse2) (and (and .cse0 (= main_~a~0 .cse3) (<= (+ main_~b~0 1) main_~a~0)) .cse1 .cse2)))) [2019-09-08 03:31:45,287 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 5 11) the Hoare annotation is: true [2019-09-08 03:31:45,288 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2019-09-08 03:31:45,288 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 5 11) no Hoare annotation was computed. [2019-09-08 03:31:45,288 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 8) no Hoare annotation was computed. [2019-09-08 03:31:45,288 INFO L443 ceAbstractionStarter]: For program point L6(lines 6 9) no Hoare annotation was computed. [2019-09-08 03:31:45,288 INFO L443 ceAbstractionStarter]: For program point L6-2(lines 5 11) no Hoare annotation was computed. [2019-09-08 03:31:45,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,296 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,297 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,298 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,299 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 03:31:45 BoogieIcfgContainer [2019-09-08 03:31:45,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 03:31:45,332 INFO L168 Benchmark]: Toolchain (without parser) took 580558.97 ms. Allocated memory was 134.7 MB in the beginning and 632.8 MB in the end (delta: 498.1 MB). Free memory was 91.2 MB in the beginning and 435.8 MB in the end (delta: -344.6 MB). Peak memory consumption was 551.0 MB. Max. memory is 7.1 GB. [2019-09-08 03:31:45,335 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 03:31:45,335 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.18 ms. Allocated memory is still 134.7 MB. Free memory was 91.0 MB in the beginning and 81.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-08 03:31:45,339 INFO L168 Benchmark]: Boogie Preprocessor took 204.78 ms. Allocated memory was 134.7 MB in the beginning and 205.5 MB in the end (delta: 70.8 MB). Free memory was 81.0 MB in the beginning and 181.7 MB in the end (delta: -100.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2019-09-08 03:31:45,340 INFO L168 Benchmark]: RCFGBuilder took 295.48 ms. Allocated memory is still 205.5 MB. Free memory was 181.7 MB in the beginning and 168.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-09-08 03:31:45,340 INFO L168 Benchmark]: TraceAbstraction took 579754.65 ms. Allocated memory was 205.5 MB in the beginning and 632.8 MB in the end (delta: 427.3 MB). Free memory was 168.1 MB in the beginning and 435.8 MB in the end (delta: -267.7 MB). Peak memory consumption was 557.2 MB. Max. memory is 7.1 GB. [2019-09-08 03:31:45,343 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.18 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.18 ms. Allocated memory is still 134.7 MB. Free memory was 91.0 MB in the beginning and 81.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 204.78 ms. Allocated memory was 134.7 MB in the beginning and 205.5 MB in the end (delta: 70.8 MB). Free memory was 81.0 MB in the beginning and 181.7 MB in the end (delta: -100.7 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 295.48 ms. Allocated memory is still 205.5 MB. Free memory was 181.7 MB in the beginning and 168.7 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 579754.65 ms. Allocated memory was 205.5 MB in the beginning and 632.8 MB in the end (delta: 427.3 MB). Free memory was 168.1 MB in the beginning and 435.8 MB in the end (delta: -267.7 MB). Peak memory consumption was 557.2 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_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~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: 29]: Loop Invariant [2019-09-08 03:31:45,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,361 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] [2019-09-08 03:31:45,362 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~s~0_51,QUANTIFIED] [2019-09-08 03:31:45,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~temp~0,QUANTIFIED] [2019-09-08 03:31:45,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~p~0_44,QUANTIFIED] [2019-09-08 03:31:45,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~q~0_50,QUANTIFIED] [2019-09-08 03:31:45,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~k~0,QUANTIFIED] Derived loop invariant: (((1 <= x && a == p * x + y * r && b + 1 <= a) && (\exists v_main_~q~0_50 : int, v_main_~p~0_44 : int, main_~k~0 : int, main_~temp~0 : int, v_main_~s~0_51 : int :: (main_~temp~0 + -(v_main_~s~0_51 * main_~k~0) == s && b + main_~k~0 * (v_main_~s~0_51 * y + v_main_~q~0_50 * x) == y * main_~temp~0 + v_main_~p~0_44 * x) && v_main_~p~0_44 + -(v_main_~q~0_50 * main_~k~0) == q)) || (((((r == 1 && 1 <= x) && a == p * x + y * r && b + 1 <= a) && p == 0) && q == -(p * (-1 * s)) + 1) && (\exists v_main_~q~0_50 : int, v_main_~p~0_44 : int, main_~k~0 : int, main_~temp~0 : int, v_main_~s~0_51 : int :: (main_~temp~0 + -(v_main_~s~0_51 * main_~k~0) == s && b + main_~k~0 * (v_main_~s~0_51 * y + v_main_~q~0_50 * x) == y * main_~temp~0 + v_main_~p~0_44 * x) && v_main_~p~0_44 + -(v_main_~q~0_50 * main_~k~0) == q))) || (((((((((a == p * x + y * r && c < b) && 1 <= b) && r == 0) && b == y) && k == 0) && 1 <= x) && q == 0) && a == x) && (\exists v_main_~q~0_50 : int, v_main_~p~0_44 : int, main_~k~0 : int, main_~temp~0 : int, v_main_~s~0_51 : int :: (main_~temp~0 + -(v_main_~s~0_51 * main_~k~0) == s && b + main_~k~0 * (v_main_~s~0_51 * y + v_main_~q~0_50 * x) == y * main_~temp~0 + v_main_~p~0_44 * x) && v_main_~p~0_44 + -(v_main_~q~0_50 * main_~k~0) == q)) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((((p == 1 && b == y * s + q * x) && b == y) && x == k * y + c) && 1 <= x) && q == 0) && a == x) && p * x + y * r == c + b * k) || ((((b == y * s + q * x && a == p * x + y * r) && b + 1 <= a) && 1 <= x) && p * x + y * r == c + b * k) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. SAFE Result, 579.6s OverallTime, 36 OverallIterations, 57 TraceHistogramMax, 106.7s AutomataDifference, 0.0s DeadEndRemovalTime, 436.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 1438 SDtfs, 842 SDslu, 10276 SDs, 0 SdLazy, 15089 SolverSat, 1394 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 67.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4686 GetRequests, 4192 SyntacticMatches, 8 SemanticMatches, 486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 57.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=994occurred in iteration=35, 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: 2.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 1116 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 496 PreInvPairs, 1056 NumberOfFragments, 851 HoareAnnotationTreeSize, 496 FomulaSimplifications, 17526831 FormulaSimplificationTreeSizeReduction, 7.9s HoareSimplificationTime, 13 FomulaSimplificationsInter, 2501084 FormulaSimplificationTreeSizeReductionInter, 428.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 4550 NumberOfCodeBlocks, 3594 NumberOfCodeBlocksAsserted, 147 NumberOfCheckSat, 4514 ConstructedInterpolants, 18 QuantifiedInterpolants, 6812938 SizeOfPredicates, 310 NumberOfNonLiveVariables, 8248 ConjunctsInSsa, 1550 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 47844/52721 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...