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/reducercommutativity/rangesum10.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 11:11:08,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 11:11:08,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 11:11:08,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 11:11:08,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 11:11:08,244 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 11:11:08,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 11:11:08,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 11:11:08,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 11:11:08,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 11:11:08,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 11:11:08,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 11:11:08,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 11:11:08,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 11:11:08,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 11:11:08,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 11:11:08,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 11:11:08,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 11:11:08,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 11:11:08,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 11:11:08,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 11:11:08,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 11:11:08,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 11:11:08,264 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 11:11:08,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 11:11:08,267 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 11:11:08,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 11:11:08,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 11:11:08,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 11:11:08,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 11:11:08,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 11:11:08,270 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 11:11:08,270 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 11:11:08,271 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 11:11:08,272 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 11:11:08,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 11:11:08,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 11:11:08,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 11:11:08,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 11:11:08,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 11:11:08,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 11:11:08,276 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-07 11:11:08,290 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 11:11:08,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 11:11:08,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 11:11:08,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 11:11:08,292 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 11:11:08,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 11:11:08,293 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 11:11:08,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 11:11:08,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 11:11:08,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 11:11:08,294 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 11:11:08,294 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 11:11:08,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 11:11:08,294 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 11:11:08,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 11:11:08,295 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 11:11:08,295 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 11:11:08,295 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 11:11:08,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 11:11:08,296 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 11:11:08,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 11:11:08,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 11:11:08,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 11:11:08,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 11:11:08,297 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 11:11:08,297 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 11:11:08,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 11:11:08,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 11:11:08,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 11:11:08,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 11:11:08,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 11:11:08,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 11:11:08,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 11:11:08,352 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 11:11:08,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/rangesum10.i [2019-09-07 11:11:08,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca5398c9/6085b24fd0fd457c86b3baa8476d574d/FLAG14295662d [2019-09-07 11:11:08,900 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 11:11:08,901 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/rangesum10.i [2019-09-07 11:11:08,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca5398c9/6085b24fd0fd457c86b3baa8476d574d/FLAG14295662d [2019-09-07 11:11:09,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca5398c9/6085b24fd0fd457c86b3baa8476d574d [2019-09-07 11:11:09,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 11:11:09,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 11:11:09,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 11:11:09,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 11:11:09,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 11:11:09,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df8f01b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09, skipping insertion in model container [2019-09-07 11:11:09,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,274 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 11:11:09,292 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 11:11:09,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:11:09,501 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 11:11:09,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 11:11:09,545 INFO L192 MainTranslator]: Completed translation [2019-09-07 11:11:09,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09 WrapperNode [2019-09-07 11:11:09,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 11:11:09,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 11:11:09,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 11:11:09,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 11:11:09,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,654 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (1/1) ... [2019-09-07 11:11:09,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 11:11:09,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 11:11:09,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 11:11:09,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 11:11:09,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (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-07 11:11:09,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 11:11:09,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 11:11:09,742 INFO L138 BoogieDeclarations]: Found implementation of procedure init_nondet [2019-09-07 11:11:09,742 INFO L138 BoogieDeclarations]: Found implementation of procedure rangesum [2019-09-07 11:11:09,743 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 11:11:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 11:11:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 11:11:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure init_nondet [2019-09-07 11:11:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 11:11:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure rangesum [2019-09-07 11:11:09,743 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 11:11:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 11:11:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 11:11:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 11:11:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 11:11:09,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 11:11:10,074 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 11:11:10,075 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 11:11:10,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:11:10 BoogieIcfgContainer [2019-09-07 11:11:10,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 11:11:10,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 11:11:10,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 11:11:10,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 11:11:10,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 11:11:09" (1/3) ... [2019-09-07 11:11:10,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2882af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:11:10, skipping insertion in model container [2019-09-07 11:11:10,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 11:11:09" (2/3) ... [2019-09-07 11:11:10,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2882af2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 11:11:10, skipping insertion in model container [2019-09-07 11:11:10,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 11:11:10" (3/3) ... [2019-09-07 11:11:10,092 INFO L109 eAbstractionObserver]: Analyzing ICFG rangesum10.i [2019-09-07 11:11:10,100 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 11:11:10,105 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 11:11:10,122 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 11:11:10,152 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 11:11:10,153 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 11:11:10,153 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 11:11:10,153 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 11:11:10,154 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 11:11:10,154 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 11:11:10,154 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 11:11:10,154 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 11:11:10,154 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 11:11:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-09-07 11:11:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 11:11:10,175 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:10,176 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:10,178 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:10,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash -332770493, now seen corresponding path program 1 times [2019-09-07 11:11:10,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:10,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:10,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2019-09-07 11:11:10,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:10,319 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:10,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-07 11:11:10,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:11:10,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:11:10,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 11:11:10,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 11:11:10,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 11:11:10,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 11:11:10,468 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-09-07 11:11:10,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:10,491 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2019-09-07 11:11:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 11:11:10,493 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 37 [2019-09-07 11:11:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:10,502 INFO L225 Difference]: With dead ends: 64 [2019-09-07 11:11:10,502 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 11:11:10,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 36 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-07 11:11:10,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 11:11:10,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-07 11:11:10,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 11:11:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-09-07 11:11:10,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 37 [2019-09-07 11:11:10,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:10,543 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-09-07 11:11:10,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 11:11:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-09-07 11:11:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 11:11:10,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:10,547 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:10,547 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:10,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:10,548 INFO L82 PathProgramCache]: Analyzing trace with hash -991975144, now seen corresponding path program 1 times [2019-09-07 11:11:10,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:10,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:10,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,566 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:10,566 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:10,566 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:10,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:10,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:11:10,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:11:10,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:11:10,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:11:10,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:11:10,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:11:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:11:10,662 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2019-09-07 11:11:10,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:10,682 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2019-09-07 11:11:10,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:11:10,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-07 11:11:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:10,684 INFO L225 Difference]: With dead ends: 56 [2019-09-07 11:11:10,685 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 11:11:10,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-07 11:11:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 11:11:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-07 11:11:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 11:11:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2019-09-07 11:11:10,693 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2019-09-07 11:11:10,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:10,694 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2019-09-07 11:11:10,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:11:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2019-09-07 11:11:10,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 11:11:10,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:10,696 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:10,696 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:10,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:10,697 INFO L82 PathProgramCache]: Analyzing trace with hash 479004822, now seen corresponding path program 1 times [2019-09-07 11:11:10,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:10,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,712 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:10,713 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:10,713 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) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:10,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:10,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:11:10,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-07 11:11:10,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 11:11:10,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 11:11:10,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 11:11:10,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 11:11:10,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 11:11:10,836 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2019-09-07 11:11:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:10,860 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2019-09-07 11:11:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:11:10,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-09-07 11:11:10,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:10,866 INFO L225 Difference]: With dead ends: 57 [2019-09-07 11:11:10,866 INFO L226 Difference]: Without dead ends: 39 [2019-09-07 11:11:10,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-07 11:11:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-07 11:11:10,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-07 11:11:10,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 11:11:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-09-07 11:11:10,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 39 [2019-09-07 11:11:10,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:10,890 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-09-07 11:11:10,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 11:11:10,894 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-09-07 11:11:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 11:11:10,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:10,896 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:10,897 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:10,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:10,898 INFO L82 PathProgramCache]: Analyzing trace with hash -22870507, now seen corresponding path program 1 times [2019-09-07 11:11:10,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:10,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:10,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:10,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:10,980 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-07 11:11:10,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:10,981 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:11,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:11,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:11:11,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 11:11:11,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:11,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-09-07 11:11:11,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:11:11,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:11:11,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:11,078 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2019-09-07 11:11:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:11,126 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2019-09-07 11:11:11,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 11:11:11,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-09-07 11:11:11,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:11,130 INFO L225 Difference]: With dead ends: 62 [2019-09-07 11:11:11,130 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 11:11:11,133 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 11:11:11,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-07 11:11:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-07 11:11:11,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-09-07 11:11:11,142 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 39 [2019-09-07 11:11:11,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:11,143 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-09-07 11:11:11,143 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:11:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-09-07 11:11:11,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-07 11:11:11,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:11,148 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:11,151 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 496221539, now seen corresponding path program 1 times [2019-09-07 11:11:11,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:11,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-07 11:11:11,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 11:11:11,242 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 -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 11:11:11,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:11,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-07 11:11:11,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 11:11:11,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:11,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-07 11:11:11,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:11:11,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:11:11,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:11,351 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 5 states. [2019-09-07 11:11:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:11,410 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2019-09-07 11:11:11,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:11:11,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-09-07 11:11:11,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:11,412 INFO L225 Difference]: With dead ends: 68 [2019-09-07 11:11:11,412 INFO L226 Difference]: Without dead ends: 44 [2019-09-07 11:11:11,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-07 11:11:11,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2019-09-07 11:11:11,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-07 11:11:11,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-09-07 11:11:11,419 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 48 [2019-09-07 11:11:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:11,420 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-09-07 11:11:11,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:11:11,420 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-09-07 11:11:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-07 11:11:11,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:11,421 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:11,422 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:11,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:11,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1681907214, now seen corresponding path program 1 times [2019-09-07 11:11:11,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:11,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:11,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:11,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,435 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:11,435 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:11,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-07 11:11:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:11,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:11:11,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-07 11:11:11,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:11,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-09-07 11:11:11,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:11:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:11:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:11,530 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 4 states. [2019-09-07 11:11:11,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:11,564 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-09-07 11:11:11,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:11:11,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-09-07 11:11:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:11,567 INFO L225 Difference]: With dead ends: 68 [2019-09-07 11:11:11,567 INFO L226 Difference]: Without dead ends: 41 [2019-09-07 11:11:11,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:11,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-07 11:11:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-09-07 11:11:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 11:11:11,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-07 11:11:11,581 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 59 [2019-09-07 11:11:11,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:11,582 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-07 11:11:11,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:11:11,582 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-07 11:11:11,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 11:11:11,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:11,585 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:11,585 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:11,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:11,585 INFO L82 PathProgramCache]: Analyzing trace with hash 804630256, now seen corresponding path program 2 times [2019-09-07 11:11:11,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,617 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:11,617 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:11,617 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-07 11:11:11,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:11:11,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:11:11,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:11,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:11:11,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-07 11:11:11,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:11,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-07 11:11:11,732 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:11:11,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:11:11,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:11,732 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 5 states. [2019-09-07 11:11:11,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:11,755 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2019-09-07 11:11:11,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:11:11,756 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-07 11:11:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:11,757 INFO L225 Difference]: With dead ends: 70 [2019-09-07 11:11:11,757 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 11:11:11,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:11,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 11:11:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-07 11:11:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 11:11:11,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-07 11:11:11,764 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 61 [2019-09-07 11:11:11,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:11,764 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-07 11:11:11,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:11:11,765 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-07 11:11:11,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-07 11:11:11,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:11,766 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:11,766 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:11,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1929644946, now seen corresponding path program 3 times [2019-09-07 11:11:11,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:11,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,783 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:11,783 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:11,783 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-07 11:11:11,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:11,845 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 11:11:11,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:11,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:11:11,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:11,894 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 11:11:11,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:11,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-07 11:11:11,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:11:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:11:11,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:11,900 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2019-09-07 11:11:11,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:11,935 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-09-07 11:11:11,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:11:11,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-09-07 11:11:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:11,938 INFO L225 Difference]: With dead ends: 70 [2019-09-07 11:11:11,938 INFO L226 Difference]: Without dead ends: 47 [2019-09-07 11:11:11,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:11,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-07 11:11:11,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2019-09-07 11:11:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-07 11:11:11,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2019-09-07 11:11:11,946 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 63 [2019-09-07 11:11:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:11,946 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2019-09-07 11:11:11,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:11:11,946 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2019-09-07 11:11:11,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-07 11:11:11,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:11,948 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:11,948 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash -575638740, now seen corresponding path program 4 times [2019-09-07 11:11:11,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:11,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:11,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:11,962 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:11,962 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:11,962 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-07 11:11:11,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:11:12,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:12,028 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:12,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:11:12,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-07 11:11:12,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:12,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-07 11:11:12,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:11:12,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:11:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:11:12,085 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 6 states. [2019-09-07 11:11:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:12,110 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2019-09-07 11:11:12,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:11:12,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-09-07 11:11:12,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:12,111 INFO L225 Difference]: With dead ends: 78 [2019-09-07 11:11:12,112 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 11:11:12,112 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:11:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 11:11:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2019-09-07 11:11:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 11:11:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-09-07 11:11:12,119 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 72 [2019-09-07 11:11:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:12,119 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-09-07 11:11:12,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:11:12,119 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-09-07 11:11:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-07 11:11:12,121 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:12,121 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:12,121 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:12,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:12,122 INFO L82 PathProgramCache]: Analyzing trace with hash -336825618, now seen corresponding path program 5 times [2019-09-07 11:11:12,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:12,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:12,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:12,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,136 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:12,136 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:12,136 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:12,167 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:11:12,245 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 11:11:12,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:12,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:11:12,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 101 proven. 2 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 11:11:12,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:12,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-09-07 11:11:12,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:11:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:11:12,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:12,275 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2019-09-07 11:11:12,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:12,309 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2019-09-07 11:11:12,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:11:12,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-09-07 11:11:12,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:12,310 INFO L225 Difference]: With dead ends: 77 [2019-09-07 11:11:12,310 INFO L226 Difference]: Without dead ends: 51 [2019-09-07 11:11:12,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-07 11:11:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-09-07 11:11:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 11:11:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-09-07 11:11:12,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 74 [2019-09-07 11:11:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:12,324 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-09-07 11:11:12,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:11:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-09-07 11:11:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-07 11:11:12,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:12,330 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:12,330 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1535873938, now seen corresponding path program 6 times [2019-09-07 11:11:12,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:12,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:12,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,361 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:12,361 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:12,361 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-07 11:11:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:12,468 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 11:11:12,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:12,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 11:11:12,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:12,492 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-09-07 11:11:12,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:12,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-09-07 11:11:12,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 11:11:12,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 11:11:12,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:12,500 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2019-09-07 11:11:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:12,518 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-09-07 11:11:12,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 11:11:12,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-09-07 11:11:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:12,520 INFO L225 Difference]: With dead ends: 76 [2019-09-07 11:11:12,520 INFO L226 Difference]: Without dead ends: 53 [2019-09-07 11:11:12,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 11:11:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-07 11:11:12,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-09-07 11:11:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 11:11:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-09-07 11:11:12,535 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 83 [2019-09-07 11:11:12,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:12,536 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-09-07 11:11:12,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 11:11:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-09-07 11:11:12,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-07 11:11:12,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:12,539 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:12,540 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:12,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:12,540 INFO L82 PathProgramCache]: Analyzing trace with hash -2064866548, now seen corresponding path program 7 times [2019-09-07 11:11:12,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:12,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:12,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,564 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:12,565 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:12,565 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) [2019-09-07 11:11:12,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:12,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:11:12,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 11:11:12,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-07 11:11:12,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:11:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:11:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:11:12,690 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 7 states. [2019-09-07 11:11:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:12,720 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2019-09-07 11:11:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:11:12,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2019-09-07 11:11:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:12,723 INFO L225 Difference]: With dead ends: 90 [2019-09-07 11:11:12,723 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 11:11:12,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:11:12,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 11:11:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-09-07 11:11:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 11:11:12,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2019-09-07 11:11:12,742 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 85 [2019-09-07 11:11:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:12,743 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2019-09-07 11:11:12,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:11:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2019-09-07 11:11:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 11:11:12,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:12,745 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:12,745 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:12,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash -998650230, now seen corresponding path program 8 times [2019-09-07 11:11:12,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:12,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:12,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:12,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:12,776 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:12,776 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:12,776 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-07 11:11:12,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:11:12,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:11:12,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:12,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:11:12,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-09-07 11:11:12,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:12,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-07 11:11:12,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:11:12,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:11:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:11:12,963 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 8 states. [2019-09-07 11:11:13,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:13,010 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2019-09-07 11:11:13,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:11:13,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 87 [2019-09-07 11:11:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:13,012 INFO L225 Difference]: With dead ends: 92 [2019-09-07 11:11:13,013 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 11:11:13,013 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:11:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 11:11:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-09-07 11:11:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-09-07 11:11:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2019-09-07 11:11:13,027 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 87 [2019-09-07 11:11:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:13,028 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2019-09-07 11:11:13,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:11:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2019-09-07 11:11:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 11:11:13,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:13,029 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:13,029 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:13,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1433014920, now seen corresponding path program 9 times [2019-09-07 11:11:13,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:13,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:13,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,054 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:13,055 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:13,055 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-07 11:11:13,077 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-07 11:11:13,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 11:11:13,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:13,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 11:11:13,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2019-09-07 11:11:13,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:13,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-07 11:11:13,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 11:11:13,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 11:11:13,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:13,171 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 5 states. [2019-09-07 11:11:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:13,192 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2019-09-07 11:11:13,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 11:11:13,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-09-07 11:11:13,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:13,195 INFO L225 Difference]: With dead ends: 82 [2019-09-07 11:11:13,195 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 11:11:13,196 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 11:11:13,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 11:11:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-09-07 11:11:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-07 11:11:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2019-09-07 11:11:13,202 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 89 [2019-09-07 11:11:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:13,202 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2019-09-07 11:11:13,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 11:11:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2019-09-07 11:11:13,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 11:11:13,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:13,217 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 6, 6, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:13,217 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:13,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:13,218 INFO L82 PathProgramCache]: Analyzing trace with hash -820958554, now seen corresponding path program 10 times [2019-09-07 11:11:13,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:13,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:13,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:13,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,239 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:13,240 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:13,240 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) [2019-09-07 11:11:13,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:13,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:13,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:13,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:11:13,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:13,376 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-09-07 11:11:13,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:13,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-07 11:11:13,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:11:13,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:11:13,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:11:13,385 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand 9 states. [2019-09-07 11:11:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:13,420 INFO L93 Difference]: Finished difference Result 98 states and 112 transitions. [2019-09-07 11:11:13,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:11:13,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2019-09-07 11:11:13,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:13,423 INFO L225 Difference]: With dead ends: 98 [2019-09-07 11:11:13,423 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 11:11:13,424 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:11:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 11:11:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-09-07 11:11:13,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-07 11:11:13,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-09-07 11:11:13,431 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 91 [2019-09-07 11:11:13,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:13,432 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-09-07 11:11:13,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:11:13,432 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-09-07 11:11:13,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-07 11:11:13,435 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:13,435 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 7, 7, 6, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:13,435 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash 639844260, now seen corresponding path program 11 times [2019-09-07 11:11:13,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:13,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:13,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,451 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:13,452 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:13,452 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-07 11:11:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:13,496 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-09-07 11:11:13,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:13,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:11:13,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 129 proven. 7 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-09-07 11:11:13,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:13,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-07 11:11:13,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:11:13,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:11:13,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:11:13,543 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 6 states. [2019-09-07 11:11:13,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:13,585 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-09-07 11:11:13,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:11:13,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-09-07 11:11:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:13,587 INFO L225 Difference]: With dead ends: 98 [2019-09-07 11:11:13,587 INFO L226 Difference]: Without dead ends: 65 [2019-09-07 11:11:13,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:11:13,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-07 11:11:13,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-09-07 11:11:13,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 11:11:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-09-07 11:11:13,592 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 93 [2019-09-07 11:11:13,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:13,593 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-09-07 11:11:13,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:11:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-09-07 11:11:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-07 11:11:13,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:13,594 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 9, 7, 7, 6, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:13,594 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:13,595 INFO L82 PathProgramCache]: Analyzing trace with hash 266389106, now seen corresponding path program 12 times [2019-09-07 11:11:13,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:13,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:13,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:13,606 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:13,607 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:13,607 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-07 11:11:13,631 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:18,845 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 11:11:18,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:18,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 11:11:18,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 433 backedges. 180 proven. 9 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-09-07 11:11:18,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:18,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-07 11:11:18,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 11:11:18,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 11:11:18,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:11:18,905 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 6 states. [2019-09-07 11:11:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:18,929 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2019-09-07 11:11:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 11:11:18,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-07 11:11:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:18,930 INFO L225 Difference]: With dead ends: 92 [2019-09-07 11:11:18,930 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 11:11:18,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 11:11:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 11:11:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2019-09-07 11:11:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-07 11:11:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2019-09-07 11:11:18,935 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 102 [2019-09-07 11:11:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:18,936 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2019-09-07 11:11:18,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 11:11:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2019-09-07 11:11:18,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-07 11:11:18,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:18,937 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 9, 7, 7, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:18,938 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 902866836, now seen corresponding path program 13 times [2019-09-07 11:11:18,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:18,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:18,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:18,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:18,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:18,949 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:18,949 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:18,950 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) [2019-09-07 11:11:18,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:19,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:11:19,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 11:11:19,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:19,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-07 11:11:19,124 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:11:19,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:11:19,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:11:19,125 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand 10 states. [2019-09-07 11:11:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:19,165 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2019-09-07 11:11:19,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:11:19,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2019-09-07 11:11:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:19,167 INFO L225 Difference]: With dead ends: 110 [2019-09-07 11:11:19,167 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 11:11:19,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:11:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 11:11:19,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-09-07 11:11:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-09-07 11:11:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2019-09-07 11:11:19,172 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 104 [2019-09-07 11:11:19,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:19,172 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2019-09-07 11:11:19,172 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:11:19,173 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2019-09-07 11:11:19,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 11:11:19,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:19,174 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 9, 8, 8, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:19,174 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:19,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:19,174 INFO L82 PathProgramCache]: Analyzing trace with hash -640868522, now seen corresponding path program 14 times [2019-09-07 11:11:19,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:19,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:19,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:19,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,185 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:19,186 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:19,186 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:19,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 11:11:19,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:11:19,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:19,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:11:19,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-09-07 11:11:19,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-07 11:11:19,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:11:19,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:11:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:11:19,345 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand 11 states. [2019-09-07 11:11:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:19,392 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2019-09-07 11:11:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:11:19,392 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 106 [2019-09-07 11:11:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:19,393 INFO L225 Difference]: With dead ends: 112 [2019-09-07 11:11:19,393 INFO L226 Difference]: Without dead ends: 70 [2019-09-07 11:11:19,394 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:11:19,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-07 11:11:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-09-07 11:11:19,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-09-07 11:11:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2019-09-07 11:11:19,398 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 106 [2019-09-07 11:11:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:19,399 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2019-09-07 11:11:19,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:11:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2019-09-07 11:11:19,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-07 11:11:19,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:19,400 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 9, 9, 9, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:19,400 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:19,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:19,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1888136856, now seen corresponding path program 15 times [2019-09-07 11:11:19,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:19,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,412 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:19,413 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:19,413 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-07 11:11:19,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 11:11:19,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 11:11:19,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:19,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:11:19,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 178 proven. 35 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2019-09-07 11:11:19,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:19,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-07 11:11:19,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:11:19,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:11:19,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:11:19,562 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand 8 states. [2019-09-07 11:11:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:19,605 INFO L93 Difference]: Finished difference Result 119 states and 140 transitions. [2019-09-07 11:11:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:11:19,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-07 11:11:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:19,607 INFO L225 Difference]: With dead ends: 119 [2019-09-07 11:11:19,607 INFO L226 Difference]: Without dead ends: 81 [2019-09-07 11:11:19,607 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:11:19,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-07 11:11:19,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-09-07 11:11:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 11:11:19,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 89 transitions. [2019-09-07 11:11:19,612 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 89 transitions. Word has length 108 [2019-09-07 11:11:19,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:19,613 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 89 transitions. [2019-09-07 11:11:19,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:11:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 89 transitions. [2019-09-07 11:11:19,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-07 11:11:19,614 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:19,614 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 18, 9, 9, 9, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:19,615 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:19,615 INFO L82 PathProgramCache]: Analyzing trace with hash 946403736, now seen corresponding path program 16 times [2019-09-07 11:11:19,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:19,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:19,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,628 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:19,628 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:19,629 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-07 11:11:19,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:19,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:19,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:19,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 11:11:19,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2019-09-07 11:11:19,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:19,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-07 11:11:19,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 11:11:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 11:11:19,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:11:19,801 INFO L87 Difference]: Start difference. First operand 81 states and 89 transitions. Second operand 12 states. [2019-09-07 11:11:19,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:19,851 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2019-09-07 11:11:19,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 11:11:19,852 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 144 [2019-09-07 11:11:19,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:19,853 INFO L225 Difference]: With dead ends: 137 [2019-09-07 11:11:19,853 INFO L226 Difference]: Without dead ends: 83 [2019-09-07 11:11:19,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 11:11:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-07 11:11:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-09-07 11:11:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-09-07 11:11:19,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2019-09-07 11:11:19,859 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 144 [2019-09-07 11:11:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:19,859 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2019-09-07 11:11:19,859 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 11:11:19,860 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2019-09-07 11:11:19,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 11:11:19,861 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:19,861 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 18, 10, 10, 9, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:19,862 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:19,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:19,862 INFO L82 PathProgramCache]: Analyzing trace with hash 901973850, now seen corresponding path program 17 times [2019-09-07 11:11:19,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:19,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:19,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:19,878 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:19,878 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:19,878 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-07 11:11:19,901 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:19,939 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 11:11:19,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:19,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:11:19,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 588 proven. 15 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2019-09-07 11:11:20,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:20,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-07 11:11:20,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:11:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:11:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:11:20,019 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand 7 states. [2019-09-07 11:11:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:20,056 INFO L93 Difference]: Finished difference Result 136 states and 155 transitions. [2019-09-07 11:11:20,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:11:20,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 146 [2019-09-07 11:11:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:20,058 INFO L225 Difference]: With dead ends: 136 [2019-09-07 11:11:20,058 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 11:11:20,058 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:11:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 11:11:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-07 11:11:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 11:11:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2019-09-07 11:11:20,063 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 146 [2019-09-07 11:11:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:20,063 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2019-09-07 11:11:20,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:11:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2019-09-07 11:11:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-07 11:11:20,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:20,065 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:20,065 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:20,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1171480068, now seen corresponding path program 18 times [2019-09-07 11:11:20,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:20,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:20,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:20,079 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:20,079 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:20,079 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-07 11:11:20,093 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-07 11:11:21,479 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-07 11:11:21,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:21,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 11:11:21,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1526 backedges. 650 proven. 16 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 11:11:21,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:21,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-07 11:11:21,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 11:11:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 11:11:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:11:21,549 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand 7 states. [2019-09-07 11:11:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:21,571 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2019-09-07 11:11:21,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 11:11:21,572 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-07 11:11:21,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:21,573 INFO L225 Difference]: With dead ends: 130 [2019-09-07 11:11:21,573 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 11:11:21,573 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 11:11:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 11:11:21,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-07 11:11:21,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 11:11:21,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-09-07 11:11:21,578 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 155 [2019-09-07 11:11:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:21,578 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-09-07 11:11:21,579 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 11:11:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-09-07 11:11:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-07 11:11:21,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:21,581 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:21,581 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:21,581 INFO L82 PathProgramCache]: Analyzing trace with hash 157880730, now seen corresponding path program 19 times [2019-09-07 11:11:21,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:21,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:21,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:21,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:21,595 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:21,595 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:21,596 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-07 11:11:21,609 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-07 11:11:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 11:11:21,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 11:11:21,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:21,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 650 proven. 25 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 11:11:21,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:21,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-09-07 11:11:21,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 11:11:21,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 11:11:21,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:11:21,735 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 8 states. [2019-09-07 11:11:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:21,759 INFO L93 Difference]: Finished difference Result 132 states and 147 transitions. [2019-09-07 11:11:21,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 11:11:21,760 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 157 [2019-09-07 11:11:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:21,761 INFO L225 Difference]: With dead ends: 132 [2019-09-07 11:11:21,761 INFO L226 Difference]: Without dead ends: 91 [2019-09-07 11:11:21,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 11:11:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-09-07 11:11:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-09-07 11:11:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 11:11:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-09-07 11:11:21,766 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 157 [2019-09-07 11:11:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:21,766 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-09-07 11:11:21,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 11:11:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-09-07 11:11:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 11:11:21,768 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:21,768 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:21,768 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2068320696, now seen corresponding path program 20 times [2019-09-07 11:11:21,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:21,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:21,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 11:11:21,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:21,780 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:21,781 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:21,781 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-07 11:11:21,794 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-07 11:11:21,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 11:11:21,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:21,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 11:11:21,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:21,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 11:11:21,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:21,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-07 11:11:21,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 11:11:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 11:11:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:11:21,945 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 9 states. [2019-09-07 11:11:21,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:21,972 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2019-09-07 11:11:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 11:11:21,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 159 [2019-09-07 11:11:21,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:21,973 INFO L225 Difference]: With dead ends: 134 [2019-09-07 11:11:21,974 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 11:11:21,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 11:11:21,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 11:11:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-09-07 11:11:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-09-07 11:11:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2019-09-07 11:11:21,984 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 159 [2019-09-07 11:11:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:21,985 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2019-09-07 11:11:21,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 11:11:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2019-09-07 11:11:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-07 11:11:21,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:21,988 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:21,988 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash -244874666, now seen corresponding path program 21 times [2019-09-07 11:11:21,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:21,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:21,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:21,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:21,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:22,004 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:22,005 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:22,005 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) [2019-09-07 11:11:22,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:22,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-09-07 11:11:22,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:22,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 11:11:22,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 650 proven. 49 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Exception during sending of exit command (exit): Stream closed [2019-09-07 11:11:22,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:22,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-07 11:11:22,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 11:11:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 11:11:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:11:22,707 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 10 states. [2019-09-07 11:11:22,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:22,738 INFO L93 Difference]: Finished difference Result 136 states and 151 transitions. [2019-09-07 11:11:22,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 11:11:22,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 161 [2019-09-07 11:11:22,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:22,739 INFO L225 Difference]: With dead ends: 136 [2019-09-07 11:11:22,740 INFO L226 Difference]: Without dead ends: 95 [2019-09-07 11:11:22,740 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 11:11:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-07 11:11:22,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-09-07 11:11:22,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 11:11:22,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2019-09-07 11:11:22,748 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 161 [2019-09-07 11:11:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:22,749 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2019-09-07 11:11:22,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 11:11:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2019-09-07 11:11:22,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-07 11:11:22,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:22,751 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:22,751 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:22,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:22,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1567441780, now seen corresponding path program 22 times [2019-09-07 11:11:22,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:22,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:22,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:22,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:22,767 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:22,767 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:22,768 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) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:22,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 11:11:22,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 11:11:22,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 11:11:22,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 11:11:22,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 11:11:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-09-07 11:11:23,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-07 11:11:23,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-07 11:11:23,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 11:11:23,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 11:11:23,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:11:23,107 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 11 states. [2019-09-07 11:11:23,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 11:11:23,158 INFO L93 Difference]: Finished difference Result 137 states and 152 transitions. [2019-09-07 11:11:23,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 11:11:23,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2019-09-07 11:11:23,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 11:11:23,160 INFO L225 Difference]: With dead ends: 137 [2019-09-07 11:11:23,160 INFO L226 Difference]: Without dead ends: 96 [2019-09-07 11:11:23,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 11:11:23,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-07 11:11:23,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-09-07 11:11:23,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 11:11:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2019-09-07 11:11:23,167 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 163 [2019-09-07 11:11:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 11:11:23,168 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2019-09-07 11:11:23,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 11:11:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2019-09-07 11:11:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 11:11:23,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 11:11:23,170 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 18, 12, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 11:11:23,170 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 11:11:23,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 11:11:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash -553175790, now seen corresponding path program 23 times [2019-09-07 11:11:23,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 11:11:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 11:11:23,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:23,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 11:11:23,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 11:11:23,200 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-07 11:11:23,200 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-07 11:11:23,200 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) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-07 11:11:23,222 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 11:11:52,829 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-09-07 11:11:52,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-09-07 11:11:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-07 11:11:53,641 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-07 11:11:53,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.09 11:11:53 BoogieIcfgContainer [2019-09-07 11:11:53,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-07 11:11:53,799 INFO L168 Benchmark]: Toolchain (without parser) took 44542.73 ms. Allocated memory was 134.7 MB in the beginning and 328.7 MB in the end (delta: 194.0 MB). Free memory was 90.9 MB in the beginning and 90.4 MB in the end (delta: 504.8 kB). Peak memory consumption was 194.5 MB. Max. memory is 7.1 GB. [2019-09-07 11:11:53,799 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-07 11:11:53,800 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.69 ms. Allocated memory is still 134.7 MB. Free memory was 90.5 MB in the beginning and 80.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. [2019-09-07 11:11:53,801 INFO L168 Benchmark]: Boogie Preprocessor took 127.03 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 80.5 MB in the beginning and 175.2 MB in the end (delta: -94.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. [2019-09-07 11:11:53,802 INFO L168 Benchmark]: RCFGBuilder took 401.92 ms. Allocated memory is still 199.2 MB. Free memory was 175.2 MB in the beginning and 157.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2019-09-07 11:11:53,802 INFO L168 Benchmark]: TraceAbstraction took 43712.39 ms. Allocated memory was 199.2 MB in the beginning and 328.7 MB in the end (delta: 129.5 MB). Free memory was 157.8 MB in the beginning and 90.4 MB in the end (delta: 67.4 MB). Peak memory consumption was 196.8 MB. Max. memory is 7.1 GB. [2019-09-07 11:11:53,806 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.23 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 289.69 ms. Allocated memory is still 134.7 MB. Free memory was 90.5 MB in the beginning and 80.5 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.03 ms. Allocated memory was 134.7 MB in the beginning and 199.2 MB in the end (delta: 64.5 MB). Free memory was 80.5 MB in the beginning and 175.2 MB in the end (delta: -94.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 401.92 ms. Allocated memory is still 199.2 MB. Free memory was 175.2 MB in the beginning and 157.8 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43712.39 ms. Allocated memory was 199.2 MB in the beginning and 328.7 MB in the end (delta: 129.5 MB). Free memory was 157.8 MB in the beginning and 90.4 MB in the end (delta: 67.4 MB). Peak memory consumption was 196.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[10]; VAL [x={1:0}] [L32] CALL init_nondet(x) VAL [x={1:0}] [L5] int i; [L6] i = 0 VAL [i=0, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=1, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=2, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=3, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=4, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=5, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=6, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=7, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=8, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=9, x={1:0}, x={1:0}] [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ VAL [i=10, x={1:0}, x={1:0}] [L6] COND FALSE !(i < 10) VAL [i=10, x={1:0}, x={1:0}] [L32] RET init_nondet(x) VAL [x={1:0}] [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; VAL [x={1:0}] [L38] CALL, EXPR rangesum(x) VAL [x={1:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=26, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=1, i=7, ret=26, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=26, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=16, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=2, i=8, ret=16, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=16, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=13, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=3, i=9, ret=13, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=13, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=11, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=4, i=10, ret=11, x={1:0}, x={1:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=11, x={1:0}, x={1:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=2, cnt=4, i=10, ret=11, x={1:0}, x={1:0}] [L38] RET, EXPR rangesum(x) VAL [rangesum(x)=2, x={1:0}] [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp VAL [ret=2, temp=20, x={1:0}] [L41] CALL, EXPR rangesum(x) VAL [x={1:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=26, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=1, i=7, ret=26, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=26, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=16, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=2, i=8, ret=16, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=16, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=13, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=3, i=9, ret=13, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=13, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=11, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=4, i=10, ret=11, x={1:0}, x={1:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=11, x={1:0}, x={1:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=2, cnt=4, i=10, ret=11, x={1:0}, x={1:0}] [L41] RET, EXPR rangesum(x) VAL [rangesum(x)=2, ret=2, temp=20, x={1:0}] [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; VAL [i=0, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=1, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=2, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=3, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=4, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=5, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=6, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=7, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=8, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ VAL [i=9, ret=2, ret2=2, temp=-1, x={1:0}] [L43] COND FALSE !(i<10 -1) VAL [i=9, ret=2, ret2=2, temp=-1, x={1:0}] [L46] x[10 -1] = temp VAL [i=9, ret=2, ret2=2, temp=-1, x={1:0}] [L47] CALL, EXPR rangesum(x) VAL [x={1:0}] [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=0, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=1, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=2, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=3, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=4, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L18] COND FALSE !(i > 10/2) VAL [cnt=0, i=5, ret=0, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=0, i=6, ret=0, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=0, i=6, ret=0, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=1, i=6, ret=-10, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=1, i=7, ret=-10, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=1, i=7, ret=-10, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=2, i=7, ret=-13, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=2, i=8, ret=-13, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=2, i=8, ret=-13, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=3, i=8, ret=-15, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=3, i=9, ret=-15, x={1:0}, x={1:0}] [L17] COND TRUE i < 10 VAL [cnt=3, i=9, ret=-15, x={1:0}, x={1:0}] [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 VAL [cnt=4, i=9, ret=-16, x={1:0}, x={1:0}] [L17] i++ VAL [cnt=4, i=10, ret=-16, x={1:0}, x={1:0}] [L17] COND FALSE !(i < 10) VAL [cnt=4, i=10, ret=-16, x={1:0}, x={1:0}] [L23] COND TRUE cnt !=0 [L24] return ret / cnt; VAL [\result=-4, cnt=4, i=10, ret=-16, x={1:0}, x={1:0}] [L47] RET, EXPR rangesum(x) VAL [i=9, rangesum(x)=-4, ret=2, ret2=2, temp=-1, x={1:0}] [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 VAL [i=9, ret=2, ret2=2, ret5=-4, temp=-1, x={1:0}] [L50] __VERIFIER_error() VAL [i=9, ret=2, ret2=2, ret5=-4, temp=-1, x={1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. UNSAFE Result, 43.6s OverallTime, 28 OverallIterations, 30 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 967 SDtfs, 161 SDslu, 1730 SDs, 0 SdLazy, 399 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2542 GetRequests, 2417 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 27 MinimizatonAttempts, 30 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 37.8s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 2851 NumberOfCodeBlocks, 2320 NumberOfCodeBlocksAsserted, 107 NumberOfCheckSat, 2620 ConstructedInterpolants, 0 QuantifiedInterpolants, 340902 SizeOfPredicates, 26 NumberOfNonLiveVariables, 5839 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 13908/14478 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...