java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/prod4br.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 20:19:25,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 20:19:25,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 20:19:25,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 20:19:25,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 20:19:25,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 20:19:25,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 20:19:25,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 20:19:25,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 20:19:25,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 20:19:25,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 20:19:25,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 20:19:25,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 20:19:25,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 20:19:25,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 20:19:25,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 20:19:25,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 20:19:25,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 20:19:25,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 20:19:25,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 20:19:25,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 20:19:25,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 20:19:25,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 20:19:25,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 20:19:25,474 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 20:19:25,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 20:19:25,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 20:19:25,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 20:19:25,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 20:19:25,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 20:19:25,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 20:19:25,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 20:19:25,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 20:19:25,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 20:19:25,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 20:19:25,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 20:19:25,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 20:19:25,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 20:19:25,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 20:19:25,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 20:19:25,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 20:19:25,484 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-03 20:19:25,505 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 20:19:25,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 20:19:25,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-03 20:19:25,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-03 20:19:25,508 INFO L138 SettingsManager]: * Use SBE=true [2019-09-03 20:19:25,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 20:19:25,508 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 20:19:25,508 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-03 20:19:25,508 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 20:19:25,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 20:19:25,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 20:19:25,509 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 20:19:25,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 20:19:25,510 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 20:19:25,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 20:19:25,511 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-03 20:19:25,511 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 20:19:25,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 20:19:25,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 20:19:25,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-03 20:19:25,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-03 20:19:25,512 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 20:19:25,512 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 20:19:25,512 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 20:19:25,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-03 20:19:25,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-03 20:19:25,513 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 20:19:25,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 20:19:25,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-03 20:19:25,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 20:19:25,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 20:19:25,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 20:19:25,575 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 20:19:25,576 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 20:19:25,576 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prod4br.c [2019-09-03 20:19:25,633 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b46c9654/4ffed5b5bd014a96980fc43c5678f6f6/FLAGfe19e4945 [2019-09-03 20:19:26,076 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 20:19:26,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br.c [2019-09-03 20:19:26,086 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b46c9654/4ffed5b5bd014a96980fc43c5678f6f6/FLAGfe19e4945 [2019-09-03 20:19:26,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b46c9654/4ffed5b5bd014a96980fc43c5678f6f6 [2019-09-03 20:19:26,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 20:19:26,459 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 20:19:26,460 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 20:19:26,460 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 20:19:26,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 20:19:26,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335c662c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26, skipping insertion in model container [2019-09-03 20:19:26,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,475 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 20:19:26,493 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 20:19:26,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:19:26,677 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 20:19:26,721 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 20:19:26,737 INFO L192 MainTranslator]: Completed translation [2019-09-03 20:19:26,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26 WrapperNode [2019-09-03 20:19:26,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 20:19:26,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 20:19:26,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 20:19:26,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 20:19:26,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,905 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,928 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (1/1) ... [2019-09-03 20:19:26,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 20:19:26,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 20:19:26,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 20:19:26,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 20:19:26,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (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-03 20:19:26,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 20:19:26,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 20:19:26,989 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 20:19:26,989 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 20:19:26,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 20:19:26,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 20:19:26,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 20:19:26,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 20:19:26,990 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 20:19:26,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 20:19:26,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 20:19:27,201 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 20:19:27,201 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-03 20:19:27,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:19:27 BoogieIcfgContainer [2019-09-03 20:19:27,203 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 20:19:27,203 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 20:19:27,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 20:19:27,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 20:19:27,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 08:19:26" (1/3) ... [2019-09-03 20:19:27,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc14992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:19:27, skipping insertion in model container [2019-09-03 20:19:27,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 08:19:26" (2/3) ... [2019-09-03 20:19:27,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dc14992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 08:19:27, skipping insertion in model container [2019-09-03 20:19:27,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 08:19:27" (3/3) ... [2019-09-03 20:19:27,210 INFO L109 eAbstractionObserver]: Analyzing ICFG prod4br.c [2019-09-03 20:19:27,220 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 20:19:27,228 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 20:19:27,244 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 20:19:27,304 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-03 20:19:27,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 20:19:27,308 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-03 20:19:27,310 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 20:19:27,310 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 20:19:27,311 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 20:19:27,311 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 20:19:27,311 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 20:19:27,311 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 20:19:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-03 20:19:27,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:19:27,353 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:27,354 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:27,358 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:27,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash 152624894, now seen corresponding path program 1 times [2019-09-03 20:19:27,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:27,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:27,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:27,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:27,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:27,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 20:19:27,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 20:19:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 20:19:27,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:19:27,490 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-03 20:19:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:27,511 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2019-09-03 20:19:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 20:19:27,512 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-03 20:19:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:27,520 INFO L225 Difference]: With dead ends: 43 [2019-09-03 20:19:27,520 INFO L226 Difference]: Without dead ends: 19 [2019-09-03 20:19:27,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 20:19:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-03 20:19:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-03 20:19:27,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-03 20:19:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-09-03 20:19:27,558 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2019-09-03 20:19:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:27,558 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-09-03 20:19:27,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 20:19:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-09-03 20:19:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-03 20:19:27,560 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:27,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:27,560 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 130400808, now seen corresponding path program 1 times [2019-09-03 20:19:27,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:27,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:27,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:27,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:27,574 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:27,574 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:27,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:27,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:27,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:19:27,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:27,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:27,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:27,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:27,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-03 20:19:27,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:19:27,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:19:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:19:27,726 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2019-09-03 20:19:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:27,836 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-09-03 20:19:27,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 20:19:27,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-03 20:19:27,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:27,838 INFO L225 Difference]: With dead ends: 33 [2019-09-03 20:19:27,838 INFO L226 Difference]: Without dead ends: 31 [2019-09-03 20:19:27,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:27,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-03 20:19:27,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-03 20:19:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-03 20:19:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-09-03 20:19:27,851 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 10 [2019-09-03 20:19:27,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:27,852 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-09-03 20:19:27,854 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:19:27,854 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-09-03 20:19:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-03 20:19:27,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:27,856 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:27,856 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1836845457, now seen corresponding path program 1 times [2019-09-03 20:19:27,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:27,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:27,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:27,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:27,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:27,872 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:27,872 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:27,872 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-03 20:19:27,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:27,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:19:27,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:27,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:28,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:28,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:28,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:19:28,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:19:28,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:19:28,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:19:28,060 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 9 states. [2019-09-03 20:19:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:28,609 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-03 20:19:28,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:19:28,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-09-03 20:19:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:28,613 INFO L225 Difference]: With dead ends: 39 [2019-09-03 20:19:28,613 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 20:19:28,614 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:19:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 20:19:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-03 20:19:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 20:19:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-09-03 20:19:28,624 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 16 [2019-09-03 20:19:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:28,624 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-09-03 20:19:28,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:19:28,625 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2019-09-03 20:19:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-03 20:19:28,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:28,626 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:28,626 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:28,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:28,627 INFO L82 PathProgramCache]: Analyzing trace with hash 682822634, now seen corresponding path program 1 times [2019-09-03 20:19:28,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:28,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:28,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:28,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:28,634 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:28,635 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:28,635 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:28,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:28,675 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:19:28,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:28,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:28,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:28,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:19:28,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:19:28,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:19:28,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:19:28,890 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 9 states. [2019-09-03 20:19:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:29,274 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2019-09-03 20:19:29,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:19:29,278 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-09-03 20:19:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:29,279 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:19:29,279 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:19:29,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:19:29,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:19:29,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2019-09-03 20:19:29,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 20:19:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-09-03 20:19:29,299 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 18 [2019-09-03 20:19:29,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:29,300 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-09-03 20:19:29,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:19:29,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-09-03 20:19:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-03 20:19:29,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:29,307 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:29,307 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1827366173, now seen corresponding path program 1 times [2019-09-03 20:19:29,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:29,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:29,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:29,324 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:29,324 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:29,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:29,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:29,364 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:19:29,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:29,454 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse16 (mod c_main_~b~0 2)) (.cse15 (mod c_main_~x~0 2))) (let ((.cse11 (= 0 .cse15)) (.cse10 (= .cse16 0))) (let ((.cse7 (<= 0 c_main_~x~0)) (.cse5 (= 1 .cse15)) (.cse0 (not .cse10)) (.cse2 (= .cse16 2)) (.cse8 (< c_main_~b~0 0)) (.cse12 (= .cse15 3)) (.cse13 (not .cse11)) (.cse1 (= c_main_~p~0 1)) (.cse3 (= c_main_~b~0 c_main_~y~0)) (.cse4 (<= 1 c_main_~y~0)) (.cse14 (< c_main_~x~0 0)) (.cse6 (exists ((v_main_~q~0_14 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_main_~q~0_14)) (= (* c_main_~y~0 c_main_~x~0) (+ v_main_~q~0_14 (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0)))))) (.cse9 (= (+ c_main_~a~0 1) c_main_~x~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9) (and .cse10 .cse1 .cse3 .cse4 .cse11 .cse5 .cse6 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse8 .cse9) (and .cse12 .cse13 .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse8 .cse9) (and .cse12 .cse13 .cse10 .cse1 .cse3 .cse4 .cse14 .cse6 .cse9))))) is different from false [2019-09-03 20:19:29,498 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse15 (mod c_main_~x~0 2)) (.cse14 (mod c_main_~b~0 2))) (let ((.cse12 (= .cse14 0)) (.cse9 (= 0 .cse15))) (let ((.cse6 (<= 0 c_main_~x~0)) (.cse5 (= 1 .cse15)) (.cse10 (= .cse15 3)) (.cse11 (not .cse9)) (.cse0 (not .cse12)) (.cse1 (= c_main_~p~0 1)) (.cse2 (= .cse14 2)) (.cse3 (= c_main_~b~0 c_main_~y~0)) (.cse4 (<= 1 c_main_~y~0)) (.cse13 (< c_main_~x~0 0)) (.cse7 (< c_main_~b~0 0)) (.cse8 (= (+ c_main_~a~0 1) c_main_~x~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_main_~q~0_14 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_main_~q~0_14)) (= (* c_main_~y~0 c_main_~x~0) (+ v_main_~q~0_14 (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0))))) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 (exists ((v_prenex_3 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_3)) (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_3)))) .cse5 .cse7 .cse8) (and .cse10 .cse11 .cse12 .cse1 .cse3 .cse4 .cse13 (exists ((v_prenex_5 Int)) (and (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_5)) (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_5)))) .cse8) (and .cse12 .cse1 .cse3 .cse4 (exists ((v_prenex_1 Int)) (and (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_1)) (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_1)))) .cse5 .cse6 .cse8) (and .cse12 .cse1 .cse3 .cse4 .cse9 .cse5 .cse8 (exists ((v_prenex_2 Int)) (and (= (* c_main_~y~0 c_main_~x~0) (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_2)) (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_2))))) (and .cse10 .cse11 .cse0 (exists ((v_prenex_4 Int)) (and (= (+ (* (* c_main_~b~0 c_main_~x~0) c_main_~p~0) v_prenex_4) (* c_main_~y~0 c_main_~x~0)) (= c_main_~q~0 (+ (* c_main_~b~0 c_main_~p~0) v_prenex_4)))) .cse1 .cse2 .cse3 .cse4 .cse13 .cse7 .cse8))))) is different from false [2019-09-03 20:19:29,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:29,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-03 20:19:29,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:19:29,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:29,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:29,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2019-09-03 20:19:29,624 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 10 states. [2019-09-03 20:19:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:29,790 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-09-03 20:19:29,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:19:29,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-03 20:19:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:29,792 INFO L225 Difference]: With dead ends: 55 [2019-09-03 20:19:29,792 INFO L226 Difference]: Without dead ends: 53 [2019-09-03 20:19:29,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=66, Unknown=2, NotChecked=34, Total=132 [2019-09-03 20:19:29,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-03 20:19:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-09-03 20:19:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-03 20:19:29,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-03 20:19:29,809 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 19 [2019-09-03 20:19:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:29,809 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-03 20:19:29,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-03 20:19:29,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-03 20:19:29,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:29,811 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:29,811 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:29,811 INFO L82 PathProgramCache]: Analyzing trace with hash 560958013, now seen corresponding path program 1 times [2019-09-03 20:19:29,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:29,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:29,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:29,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:29,817 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:29,818 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:29,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:29,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:29,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:19:29,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:19:29,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:19:29,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:19:29,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:19:29,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:19:29,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:19:29,889 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2019-09-03 20:19:29,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:29,987 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-09-03 20:19:29,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:19:29,988 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-03 20:19:29,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:29,989 INFO L225 Difference]: With dead ends: 64 [2019-09-03 20:19:29,989 INFO L226 Difference]: Without dead ends: 52 [2019-09-03 20:19:29,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:19:29,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-03 20:19:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-03 20:19:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-03 20:19:30,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-09-03 20:19:30,008 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 21 [2019-09-03 20:19:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:30,008 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-09-03 20:19:30,008 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:19:30,009 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-09-03 20:19:30,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:19:30,010 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:30,010 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:30,010 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:30,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1203344027, now seen corresponding path program 1 times [2019-09-03 20:19:30,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:30,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:30,025 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:30,026 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:30,026 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-03 20:19:30,049 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-03 20:19:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:30,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:19:30,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:30,248 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-09-03 20:19:30,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:30,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:30,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:19:30,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:19:30,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:19:30,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:19:30,300 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 9 states. [2019-09-03 20:19:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:30,631 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-09-03 20:19:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:19:30,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-03 20:19:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:30,633 INFO L225 Difference]: With dead ends: 78 [2019-09-03 20:19:30,633 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 20:19:30,634 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:19:30,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 20:19:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-03 20:19:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-03 20:19:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-09-03 20:19:30,644 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 20 [2019-09-03 20:19:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:30,644 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-09-03 20:19:30,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:19:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-09-03 20:19:30,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 20:19:30,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:30,646 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:30,646 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1146085725, now seen corresponding path program 1 times [2019-09-03 20:19:30,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:30,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:30,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:30,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:30,651 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:30,652 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:30,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:19:30,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:30,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-03 20:19:30,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:30,871 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 25 [2019-09-03 20:19:31,143 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-09-03 20:19:31,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 20:19:31,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:31,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:31,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:31,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:31,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:31,205 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 10 states. [2019-09-03 20:19:32,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:32,105 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2019-09-03 20:19:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:19:32,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-03 20:19:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:32,106 INFO L225 Difference]: With dead ends: 88 [2019-09-03 20:19:32,106 INFO L226 Difference]: Without dead ends: 74 [2019-09-03 20:19:32,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:19:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-03 20:19:32,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-09-03 20:19:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-03 20:19:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2019-09-03 20:19:32,132 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 20 [2019-09-03 20:19:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:32,132 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2019-09-03 20:19:32,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2019-09-03 20:19:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-03 20:19:32,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:32,134 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:32,134 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1259300529, now seen corresponding path program 1 times [2019-09-03 20:19:32,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:32,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:32,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:32,145 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:32,146 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:32,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:32,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:32,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:19:32,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:32,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:32,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:32,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:32,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:32,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:32,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:33,823 WARN L188 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-09-03 20:19:33,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:19:33,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:33,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:33,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:33,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:33,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=69, Unknown=2, NotChecked=0, Total=90 [2019-09-03 20:19:33,857 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand 10 states. [2019-09-03 20:19:39,875 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-03 20:19:43,969 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-03 20:19:50,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:50,780 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-09-03 20:19:50,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:19:50,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-03 20:19:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:50,782 INFO L225 Difference]: With dead ends: 85 [2019-09-03 20:19:50,782 INFO L226 Difference]: Without dead ends: 78 [2019-09-03 20:19:50,783 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=45, Invalid=161, Unknown=4, NotChecked=0, Total=210 [2019-09-03 20:19:50,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-03 20:19:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-03 20:19:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-03 20:19:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2019-09-03 20:19:50,795 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 24 [2019-09-03 20:19:50,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:50,796 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2019-09-03 20:19:50,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:50,796 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2019-09-03 20:19:50,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:50,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:50,797 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:50,797 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:50,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash -333220948, now seen corresponding path program 2 times [2019-09-03 20:19:50,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:50,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:50,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:50,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:50,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:50,802 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:50,803 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:50,803 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-03 20:19:50,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:19:50,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:19:50,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:50,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-03 20:19:50,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:50,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:50,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,211 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-03 20:19:51,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:19:51,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:51,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:51,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:51,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:51,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2019-09-03 20:19:51,243 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 10 states. [2019-09-03 20:19:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:55,556 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2019-09-03 20:19:55,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:19:55,558 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-03 20:19:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:55,560 INFO L225 Difference]: With dead ends: 94 [2019-09-03 20:19:55,560 INFO L226 Difference]: Without dead ends: 92 [2019-09-03 20:19:55,560 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2019-09-03 20:19:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-03 20:19:55,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-09-03 20:19:55,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-03 20:19:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-09-03 20:19:55,577 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 26 [2019-09-03 20:19:55,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:55,578 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-09-03 20:19:55,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:55,578 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-09-03 20:19:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:55,581 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:55,581 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:55,581 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:55,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:55,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1198817260, now seen corresponding path program 1 times [2019-09-03 20:19:55,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:55,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:55,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:55,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:55,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:55,588 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:55,589 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:55,589 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-03 20:19:55,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:55,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:19:55,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:55,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:55,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:19:55,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:55,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:55,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:55,715 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 10 states. [2019-09-03 20:19:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:56,499 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2019-09-03 20:19:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:19:56,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-03 20:19:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:56,507 INFO L225 Difference]: With dead ends: 110 [2019-09-03 20:19:56,507 INFO L226 Difference]: Without dead ends: 107 [2019-09-03 20:19:56,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:19:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-03 20:19:56,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2019-09-03 20:19:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-03 20:19:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-09-03 20:19:56,518 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 26 [2019-09-03 20:19:56,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:56,519 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-09-03 20:19:56,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:56,519 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-09-03 20:19:56,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-03 20:19:56,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:56,520 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:56,521 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:56,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:56,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1456982698, now seen corresponding path program 1 times [2019-09-03 20:19:56,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:56,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:56,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:56,527 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:56,527 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:56,527 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-03 20:19:56,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:56,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-03 20:19:56,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:56,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:56,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:19:56,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:56,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:56,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:56,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:56,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=69, Unknown=1, NotChecked=0, Total=90 [2019-09-03 20:19:56,667 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 10 states. [2019-09-03 20:19:57,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:57,077 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2019-09-03 20:19:57,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:19:57,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-03 20:19:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:57,082 INFO L225 Difference]: With dead ends: 118 [2019-09-03 20:19:57,082 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:19:57,082 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2019-09-03 20:19:57,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:19:57,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-09-03 20:19:57,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-03 20:19:57,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2019-09-03 20:19:57,093 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 26 [2019-09-03 20:19:57,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:57,093 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2019-09-03 20:19:57,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2019-09-03 20:19:57,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:19:57,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:57,095 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:57,095 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash 394786203, now seen corresponding path program 1 times [2019-09-03 20:19:57,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:57,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:57,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:57,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:57,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:57,100 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:57,100 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:57,100 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-03 20:19:57,117 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-03 20:19:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:57,135 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:19:57,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:57,644 WARN L188 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-03 20:19:57,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 7 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:19:57,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:57,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:57,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:57,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:57,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2019-09-03 20:19:57,688 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand 10 states. [2019-09-03 20:19:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:57,993 INFO L93 Difference]: Finished difference Result 112 states and 146 transitions. [2019-09-03 20:19:57,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:19:57,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-03 20:19:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:57,995 INFO L225 Difference]: With dead ends: 112 [2019-09-03 20:19:57,995 INFO L226 Difference]: Without dead ends: 110 [2019-09-03 20:19:57,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2019-09-03 20:19:57,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-09-03 20:19:58,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-09-03 20:19:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 20:19:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2019-09-03 20:19:58,005 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 27 [2019-09-03 20:19:58,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:58,005 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2019-09-03 20:19:58,006 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2019-09-03 20:19:58,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-03 20:19:58,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:58,007 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:58,007 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:58,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:58,007 INFO L82 PathProgramCache]: Analyzing trace with hash -862656033, now seen corresponding path program 2 times [2019-09-03 20:19:58,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:58,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:58,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:58,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:58,011 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:58,011 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:58,012 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) [2019-09-03 20:19:58,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:58,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:19:58,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:19:58,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:19:58,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:58,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:19:58,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:58,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 20:19:58,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:19:58,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:19:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:19:58,369 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand 11 states. [2019-09-03 20:19:58,505 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod c_main_~b~0 2) 0) (= c_main_~p~0 1) (= c_main_~b~0 c_main_~y~0) (<= 1 c_main_~y~0) (exists ((v_main_~a~0_26 Int)) (and (<= 0 v_main_~a~0_26) (<= v_main_~a~0_26 (+ c_main_~a~0 1)) (= (mod v_main_~a~0_26 2) 1) (not (= 0 v_main_~a~0_26)))) (not (= c_main_~a~0 0)) (= (+ c_main_~q~0 (* c_main_~p~0 (* c_main_~b~0 c_main_~a~0))) (* c_main_~y~0 c_main_~x~0))) is different from false [2019-09-03 20:19:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:58,950 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2019-09-03 20:19:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-03 20:19:58,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-03 20:19:58,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:58,955 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:19:58,955 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:19:58,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2019-09-03 20:19:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:19:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 108. [2019-09-03 20:19:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-03 20:19:58,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2019-09-03 20:19:58,968 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 27 [2019-09-03 20:19:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:58,969 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2019-09-03 20:19:58,969 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:19:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2019-09-03 20:19:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:19:58,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:58,970 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:58,971 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:58,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:58,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1631317159, now seen corresponding path program 1 times [2019-09-03 20:19:58,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:58,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:58,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:58,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:19:58,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:58,975 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:58,976 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:58,976 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) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:58,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:59,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-03 20:19:59,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:19:59,255 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-03 20:19:59,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:19:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:19:59,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:19:59,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:19:59,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:19:59,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:19:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:19:59,286 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand 10 states. [2019-09-03 20:19:59,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:19:59,629 INFO L93 Difference]: Finished difference Result 120 states and 156 transitions. [2019-09-03 20:19:59,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:19:59,630 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-03 20:19:59,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:19:59,631 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:19:59,631 INFO L226 Difference]: Without dead ends: 118 [2019-09-03 20:19:59,631 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:19:59,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-03 20:19:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2019-09-03 20:19:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-03 20:19:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 149 transitions. [2019-09-03 20:19:59,642 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 149 transitions. Word has length 28 [2019-09-03 20:19:59,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:19:59,642 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 149 transitions. [2019-09-03 20:19:59,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:19:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 149 transitions. [2019-09-03 20:19:59,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:19:59,643 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:19:59,644 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:19:59,644 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:19:59,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:19:59,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1688575461, now seen corresponding path program 1 times [2019-09-03 20:19:59,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:19:59,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:19:59,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:59,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:59,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:19:59,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:19:59,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:19:59,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:19:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:19:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:19:59,678 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-03 20:19:59,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:00,067 WARN L188 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-09-03 20:20:00,441 WARN L188 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2019-09-03 20:20:00,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:00,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:20:00,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:00,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-03 20:20:00,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-03 20:20:00,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-03 20:20:00,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=85, Unknown=2, NotChecked=0, Total=110 [2019-09-03 20:20:00,489 INFO L87 Difference]: Start difference. First operand 115 states and 149 transitions. Second operand 11 states. [2019-09-03 20:20:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:01,158 INFO L93 Difference]: Finished difference Result 149 states and 196 transitions. [2019-09-03 20:20:01,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-03 20:20:01,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-03 20:20:01,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:01,161 INFO L225 Difference]: With dead ends: 149 [2019-09-03 20:20:01,161 INFO L226 Difference]: Without dead ends: 127 [2019-09-03 20:20:01,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=120, Unknown=2, NotChecked=0, Total=156 [2019-09-03 20:20:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-03 20:20:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2019-09-03 20:20:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 20:20:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 157 transitions. [2019-09-03 20:20:01,173 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 157 transitions. Word has length 28 [2019-09-03 20:20:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:01,173 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 157 transitions. [2019-09-03 20:20:01,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-03 20:20:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 157 transitions. [2019-09-03 20:20:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:20:01,174 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:01,175 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:01,175 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1671899687, now seen corresponding path program 2 times [2019-09-03 20:20:01,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:01,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:01,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:01,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:01,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:01,179 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:01,180 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:01,180 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:01,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:20:01,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:20:01,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:01,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-03 20:20:01,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:01,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,594 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 31 [2019-09-03 20:20:01,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:20:01,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:01,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:20:01,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:20:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:20:01,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:20:01,650 INFO L87 Difference]: Start difference. First operand 122 states and 157 transitions. Second operand 10 states. [2019-09-03 20:20:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:04,892 INFO L93 Difference]: Finished difference Result 163 states and 216 transitions. [2019-09-03 20:20:04,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:20:04,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-03 20:20:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:04,893 INFO L225 Difference]: With dead ends: 163 [2019-09-03 20:20:04,894 INFO L226 Difference]: Without dead ends: 136 [2019-09-03 20:20:04,894 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:20:04,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-03 20:20:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 122. [2019-09-03 20:20:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-03 20:20:04,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2019-09-03 20:20:04,906 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 28 [2019-09-03 20:20:04,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:04,906 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2019-09-03 20:20:04,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:20:04,907 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2019-09-03 20:20:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-03 20:20:04,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:04,908 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:04,908 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:04,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:04,908 INFO L82 PathProgramCache]: Analyzing trace with hash 660782437, now seen corresponding path program 2 times [2019-09-03 20:20:04,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:04,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:04,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:04,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:04,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:04,912 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:04,913 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:04,913 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) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:04,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:20:04,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:20:04,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:04,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-03 20:20:04,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:05,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:05,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:05,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:05,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:05,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:05,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:20:05,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:05,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:20:05,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:20:05,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:20:05,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:20:05,171 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand 10 states. [2019-09-03 20:20:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:07,545 INFO L93 Difference]: Finished difference Result 157 states and 206 transitions. [2019-09-03 20:20:07,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:20:07,545 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-03 20:20:07,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:07,547 INFO L225 Difference]: With dead ends: 157 [2019-09-03 20:20:07,547 INFO L226 Difference]: Without dead ends: 155 [2019-09-03 20:20:07,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:20:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-03 20:20:07,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 126. [2019-09-03 20:20:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 20:20:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2019-09-03 20:20:07,561 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 28 [2019-09-03 20:20:07,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:07,561 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2019-09-03 20:20:07,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:20:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2019-09-03 20:20:07,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-03 20:20:07,562 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:07,562 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:07,563 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:07,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:07,563 INFO L82 PathProgramCache]: Analyzing trace with hash -349658598, now seen corresponding path program 1 times [2019-09-03 20:20:07,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:07,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:07,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:07,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:07,572 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:07,572 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:07,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:07,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:07,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-03 20:20:07,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:20:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:20:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-03 20:20:07,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 20:20:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 20:20:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 20:20:07,652 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 3 states. [2019-09-03 20:20:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:07,683 INFO L93 Difference]: Finished difference Result 169 states and 228 transitions. [2019-09-03 20:20:07,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 20:20:07,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-03 20:20:07,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:07,687 INFO L225 Difference]: With dead ends: 169 [2019-09-03 20:20:07,687 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 20:20:07,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-03 20:20:07,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 20:20:07,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-09-03 20:20:07,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 20:20:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 182 transitions. [2019-09-03 20:20:07,703 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 182 transitions. Word has length 29 [2019-09-03 20:20:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:07,703 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 182 transitions. [2019-09-03 20:20:07,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 20:20:07,703 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 182 transitions. [2019-09-03 20:20:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:20:07,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:07,704 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:07,704 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:07,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:07,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1615173920, now seen corresponding path program 1 times [2019-09-03 20:20:07,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:07,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:07,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:07,708 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:07,709 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:07,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:20:07,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:07,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:20:07,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:07,762 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 20:20:07,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 20:20:07,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-03 20:20:07,766 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:20:07,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:20:07,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:20:07,767 INFO L87 Difference]: Start difference. First operand 138 states and 182 transitions. Second operand 6 states. [2019-09-03 20:20:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:07,831 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2019-09-03 20:20:07,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:20:07,832 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-03 20:20:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:07,833 INFO L225 Difference]: With dead ends: 146 [2019-09-03 20:20:07,833 INFO L226 Difference]: Without dead ends: 138 [2019-09-03 20:20:07,833 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:20:07,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-03 20:20:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-09-03 20:20:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 20:20:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2019-09-03 20:20:07,846 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 31 [2019-09-03 20:20:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:07,847 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2019-09-03 20:20:07,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:20:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2019-09-03 20:20:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:20:07,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:07,848 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:07,848 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash 169189792, now seen corresponding path program 1 times [2019-09-03 20:20:07,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:07,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:07,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:07,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:07,852 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:07,852 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:07,852 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-03 20:20:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:07,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-03 20:20:07,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:20:07,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:07,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-03 20:20:07,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 20:20:07,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 20:20:07,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-03 20:20:07,940 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand 5 states. [2019-09-03 20:20:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:08,028 INFO L93 Difference]: Finished difference Result 220 states and 296 transitions. [2019-09-03 20:20:08,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-03 20:20:08,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-03 20:20:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:08,029 INFO L225 Difference]: With dead ends: 220 [2019-09-03 20:20:08,029 INFO L226 Difference]: Without dead ends: 142 [2019-09-03 20:20:08,030 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:20:08,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-09-03 20:20:08,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2019-09-03 20:20:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-03 20:20:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 175 transitions. [2019-09-03 20:20:08,054 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 175 transitions. Word has length 30 [2019-09-03 20:20:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:08,054 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 175 transitions. [2019-09-03 20:20:08,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 20:20:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 175 transitions. [2019-09-03 20:20:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-03 20:20:08,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:08,056 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:08,056 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1091445474, now seen corresponding path program 1 times [2019-09-03 20:20:08,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:08,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:08,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:08,062 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:08,063 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:08,063 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) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:08,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:08,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-03 20:20:08,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:08,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 20:20:08,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:08,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-03 20:20:08,135 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-03 20:20:08,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-03 20:20:08,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:20:08,136 INFO L87 Difference]: Start difference. First operand 138 states and 175 transitions. Second operand 7 states. [2019-09-03 20:20:08,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:08,237 INFO L93 Difference]: Finished difference Result 146 states and 183 transitions. [2019-09-03 20:20:08,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:20:08,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-03 20:20:08,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:08,241 INFO L225 Difference]: With dead ends: 146 [2019-09-03 20:20:08,241 INFO L226 Difference]: Without dead ends: 133 [2019-09-03 20:20:08,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:20:08,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-09-03 20:20:08,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2019-09-03 20:20:08,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-09-03 20:20:08,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2019-09-03 20:20:08,260 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 31 [2019-09-03 20:20:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:08,260 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2019-09-03 20:20:08,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-03 20:20:08,260 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2019-09-03 20:20:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:20:08,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:08,261 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:08,262 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash -909136864, now seen corresponding path program 2 times [2019-09-03 20:20:08,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:08,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:08,276 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:08,276 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:08,276 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-03 20:20:08,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:08,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:20:08,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:08,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-03 20:20:08,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:09,838 WARN L188 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-09-03 20:20:09,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 20:20:09,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:09,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:20:09,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:20:09,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:20:09,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:20:09,874 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand 10 states. [2019-09-03 20:20:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:10,152 INFO L93 Difference]: Finished difference Result 130 states and 160 transitions. [2019-09-03 20:20:10,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:20:10,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-09-03 20:20:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:10,154 INFO L225 Difference]: With dead ends: 130 [2019-09-03 20:20:10,154 INFO L226 Difference]: Without dead ends: 128 [2019-09-03 20:20:10,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:20:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-09-03 20:20:10,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-09-03 20:20:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-09-03 20:20:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 157 transitions. [2019-09-03 20:20:10,166 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 157 transitions. Word has length 30 [2019-09-03 20:20:10,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:10,167 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 157 transitions. [2019-09-03 20:20:10,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:20:10,167 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 157 transitions. [2019-09-03 20:20:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 20:20:10,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:10,169 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:10,169 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:10,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash -851878562, now seen corresponding path program 2 times [2019-09-03 20:20:10,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:10,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:10,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:10,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:10,179 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:10,180 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:10,180 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) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:10,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-03 20:20:10,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:20:10,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:10,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-03 20:20:10,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:10,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:20:10,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:20:10,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 20:20:10,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 20:20:10,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:10,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-03 20:20:10,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 20:20:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 20:20:10,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-03 20:20:10,389 INFO L87 Difference]: Start difference. First operand 127 states and 157 transitions. Second operand 6 states. [2019-09-03 20:20:10,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:10,481 INFO L93 Difference]: Finished difference Result 168 states and 217 transitions. [2019-09-03 20:20:10,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 20:20:10,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-03 20:20:10,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:10,483 INFO L225 Difference]: With dead ends: 168 [2019-09-03 20:20:10,483 INFO L226 Difference]: Without dead ends: 132 [2019-09-03 20:20:10,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-03 20:20:10,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-09-03 20:20:10,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2019-09-03 20:20:10,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-09-03 20:20:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2019-09-03 20:20:10,495 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 30 [2019-09-03 20:20:10,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:10,495 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2019-09-03 20:20:10,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 20:20:10,495 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2019-09-03 20:20:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:20:10,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:10,496 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:10,497 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:10,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:10,497 INFO L82 PathProgramCache]: Analyzing trace with hash 605616494, now seen corresponding path program 3 times [2019-09-03 20:20:10,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:10,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:10,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:10,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:10,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:10,504 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:10,504 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:10,504 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-03 20:20:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:10,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:20:10,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:10,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-03 20:20:10,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:10,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,782 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-09-03 20:20:10,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-03 20:20:10,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:10,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:20:10,813 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:20:10,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:20:10,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:20:10,814 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 9 states. [2019-09-03 20:20:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:15,652 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2019-09-03 20:20:15,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-03 20:20:15,653 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-03 20:20:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:15,654 INFO L225 Difference]: With dead ends: 120 [2019-09-03 20:20:15,654 INFO L226 Difference]: Without dead ends: 116 [2019-09-03 20:20:15,654 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:20:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-03 20:20:15,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-09-03 20:20:15,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-03 20:20:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 135 transitions. [2019-09-03 20:20:15,671 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 135 transitions. Word has length 34 [2019-09-03 20:20:15,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:15,672 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 135 transitions. [2019-09-03 20:20:15,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:20:15,672 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 135 transitions. [2019-09-03 20:20:15,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-03 20:20:15,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:15,673 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:15,673 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:15,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:15,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1899147156, now seen corresponding path program 1 times [2019-09-03 20:20:15,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:15,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:15,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:15,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:15,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:15,680 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:15,680 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:15,681 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-03 20:20:15,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:15,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 20:20:15,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:15,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:15,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-03 20:20:15,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-03 20:20:15,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 20:20:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 20:20:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-03 20:20:15,913 INFO L87 Difference]: Start difference. First operand 116 states and 135 transitions. Second operand 12 states. [2019-09-03 20:20:20,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:20,862 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2019-09-03 20:20:20,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-03 20:20:20,863 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-09-03 20:20:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:20,865 INFO L225 Difference]: With dead ends: 136 [2019-09-03 20:20:20,865 INFO L226 Difference]: Without dead ends: 131 [2019-09-03 20:20:20,865 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-09-03 20:20:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-03 20:20:20,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2019-09-03 20:20:20,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-03 20:20:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2019-09-03 20:20:20,880 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 34 [2019-09-03 20:20:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:20,881 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2019-09-03 20:20:20,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 20:20:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2019-09-03 20:20:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-03 20:20:20,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:20,882 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:20,882 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:20,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294560, now seen corresponding path program 1 times [2019-09-03 20:20:20,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:20,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:20,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:20,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:20,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:20,888 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:20,888 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:20,888 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-03 20:20:20,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 20:20:20,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-03 20:20:20,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:20,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:20,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:20,989 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-03 20:20:20,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:20,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-03 20:20:20,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-03 20:20:20,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-03 20:20:20,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-03 20:20:20,993 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 10 states. [2019-09-03 20:20:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:23,218 INFO L93 Difference]: Finished difference Result 129 states and 150 transitions. [2019-09-03 20:20:23,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-03 20:20:23,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-09-03 20:20:23,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:23,220 INFO L225 Difference]: With dead ends: 129 [2019-09-03 20:20:23,220 INFO L226 Difference]: Without dead ends: 124 [2019-09-03 20:20:23,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-03 20:20:23,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-09-03 20:20:23,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2019-09-03 20:20:23,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-03 20:20:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 136 transitions. [2019-09-03 20:20:23,235 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 136 transitions. Word has length 41 [2019-09-03 20:20:23,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:23,235 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 136 transitions. [2019-09-03 20:20:23,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-03 20:20:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2019-09-03 20:20:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 20:20:23,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:23,236 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:23,237 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:23,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:23,237 INFO L82 PathProgramCache]: Analyzing trace with hash -347474898, now seen corresponding path program 2 times [2019-09-03 20:20:23,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:23,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:23,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 20:20:23,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:23,251 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:23,251 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:23,252 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 20:20:23,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 20:20:23,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-03 20:20:23,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:23,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-03 20:20:23,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:23,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:23,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:23,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:24,959 WARN L188 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 28 DAG size of output: 22 [2019-09-03 20:20:25,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:25,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-03 20:20:25,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:25,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-03 20:20:25,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-03 20:20:25,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-03 20:20:25,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-03 20:20:25,147 INFO L87 Difference]: Start difference. First operand 117 states and 136 transitions. Second operand 14 states. [2019-09-03 20:20:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:38,676 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2019-09-03 20:20:38,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-03 20:20:38,677 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-09-03 20:20:38,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:38,678 INFO L225 Difference]: With dead ends: 148 [2019-09-03 20:20:38,678 INFO L226 Difference]: Without dead ends: 143 [2019-09-03 20:20:38,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-09-03 20:20:38,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-03 20:20:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2019-09-03 20:20:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-03 20:20:38,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2019-09-03 20:20:38,693 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 42 [2019-09-03 20:20:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:38,693 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2019-09-03 20:20:38,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-03 20:20:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2019-09-03 20:20:38,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 20:20:38,694 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 20:20:38,695 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 20:20:38,695 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 20:20:38,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 20:20:38,695 INFO L82 PathProgramCache]: Analyzing trace with hash -95439376, now seen corresponding path program 3 times [2019-09-03 20:20:38,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-03 20:20:38,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-03 20:20:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:38,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 20:20:38,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 20:20:38,699 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 20:20:38,699 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 20:20:38,699 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-03 20:20:38,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 20:20:38,734 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-03 20:20:38,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 20:20:38,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-03 20:20:38,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 20:20:38,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:38,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 20:20:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-09-03 20:20:38,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-03 20:20:38,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-03 20:20:38,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 20:20:38,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 20:20:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 20:20:38,793 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 9 states. [2019-09-03 20:20:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 20:20:42,991 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2019-09-03 20:20:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-03 20:20:42,992 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-03 20:20:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 20:20:42,992 INFO L225 Difference]: With dead ends: 126 [2019-09-03 20:20:42,993 INFO L226 Difference]: Without dead ends: 0 [2019-09-03 20:20:42,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-03 20:20:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-03 20:20:42,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-03 20:20:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-03 20:20:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-03 20:20:42,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-09-03 20:20:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 20:20:42,994 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-03 20:20:42,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 20:20:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-03 20:20:42,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-03 20:20:43,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-03 20:20:43,121 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 113 [2019-09-03 20:20:47,332 WARN L188 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-09-03 20:20:51,748 WARN L188 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 108 DAG size of output: 49 [2019-09-03 20:20:52,362 WARN L188 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-09-03 20:20:52,620 WARN L188 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 23 [2019-09-03 20:20:52,622 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-03 20:20:52,622 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:20:52,623 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-03 20:20:52,623 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-03 20:20:52,623 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-03 20:20:52,623 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-03 20:20:52,623 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 47) no Hoare annotation was computed. [2019-09-03 20:20:52,623 INFO L439 ceAbstractionStarter]: At program point L27-2(lines 27 48) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (* main_~y~0 main_~x~0))) (or (and (= main_~b~0 0) (and .cse0 (= .cse1 main_~q~0))) (and (and (<= 0 main_~b~0) .cse0 (= main_~a~0 0)) (= (+ main_~q~0 (* main_~p~0 (* main_~b~0 main_~a~0))) .cse1)))) [2019-09-03 20:20:52,623 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 53) no Hoare annotation was computed. [2019-09-03 20:20:52,624 INFO L439 ceAbstractionStarter]: At program point L50(line 50) the Hoare annotation is: (or (and (= main_~a~0 0) (<= 1 main_~b~0)) (and (= main_~b~0 0) (and (<= 1 main_~y~0) (= (* main_~y~0 main_~x~0) main_~q~0)))) [2019-09-03 20:20:52,624 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 53) no Hoare annotation was computed. [2019-09-03 20:20:52,624 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 47) no Hoare annotation was computed. [2019-09-03 20:20:52,624 INFO L439 ceAbstractionStarter]: At program point L40-2(lines 27 48) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (= (+ main_~q~0 (* main_~p~0 (* main_~b~0 main_~a~0))) (* main_~y~0 main_~x~0)))) (or (and (= main_~p~0 1) .cse0 (= main_~q~0 0) (<= main_~y~0 main_~b~0) .cse1 (= main_~a~0 main_~x~0)) (and .cse0 (exists ((v_main_~a~0_38 Int) (v_main_~b~0_44 Int)) (and (= main_~a~0 (div v_main_~a~0_38 2)) (= (mod v_main_~b~0_44 2) 0) (= main_~b~0 (div v_main_~b~0_44 2)) (= 0 (mod v_main_~a~0_38 2)) (= (* main_~y~0 main_~x~0) (+ (* (div main_~p~0 4) (* v_main_~a~0_38 v_main_~b~0_44)) main_~q~0)))) (<= 1 main_~b~0) (= 0 (mod main_~p~0 4))) (and (not (= 0 (mod (+ main_~a~0 1) 2))) (<= 0 main_~b~0) .cse0 .cse1))) [2019-09-03 20:20:52,624 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 53) the Hoare annotation is: true [2019-09-03 20:20:52,624 INFO L439 ceAbstractionStarter]: At program point L28(line 28) the Hoare annotation is: (let ((.cse0 (<= 1 main_~y~0)) (.cse1 (= (+ main_~q~0 (* main_~p~0 (* main_~b~0 main_~a~0))) (* main_~y~0 main_~x~0)))) (or (and (= main_~p~0 1) .cse0 (= main_~q~0 0) (<= main_~y~0 main_~b~0) .cse1 (= main_~a~0 main_~x~0)) (and .cse0 (exists ((v_main_~a~0_38 Int) (v_main_~b~0_44 Int)) (and (= main_~a~0 (div v_main_~a~0_38 2)) (= (mod v_main_~b~0_44 2) 0) (= main_~b~0 (div v_main_~b~0_44 2)) (= 0 (mod v_main_~a~0_38 2)) (= (* main_~y~0 main_~x~0) (+ (* (div main_~p~0 4) (* v_main_~a~0_38 v_main_~b~0_44)) main_~q~0)))) (<= 1 main_~b~0) (= 0 (mod main_~p~0 4))) (and (not (= 0 (mod (+ main_~a~0 1) 2))) (<= 0 main_~b~0) .cse0 .cse1))) [2019-09-03 20:20:52,624 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 27 48) no Hoare annotation was computed. [2019-09-03 20:20:52,625 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-03 20:20:52,625 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 47) no Hoare annotation was computed. [2019-09-03 20:20:52,625 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 6 12) the Hoare annotation is: true [2019-09-03 20:20:52,625 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-09-03 20:20:52,625 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 6 12) no Hoare annotation was computed. [2019-09-03 20:20:52,625 INFO L443 ceAbstractionStarter]: For program point L8(lines 8 9) no Hoare annotation was computed. [2019-09-03 20:20:52,625 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 10) no Hoare annotation was computed. [2019-09-03 20:20:52,626 INFO L443 ceAbstractionStarter]: For program point L7-2(lines 6 12) no Hoare annotation was computed. [2019-09-03 20:20:52,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,645 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,646 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.09 08:20:52 BoogieIcfgContainer [2019-09-03 20:20:52,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-03 20:20:52,654 INFO L168 Benchmark]: Toolchain (without parser) took 86192.59 ms. Allocated memory was 137.4 MB in the beginning and 378.0 MB in the end (delta: 240.6 MB). Free memory was 84.9 MB in the beginning and 269.0 MB in the end (delta: -184.1 MB). Peak memory consumption was 248.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:20:52,655 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 103.3 MB in the beginning and 103.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-03 20:20:52,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.87 ms. Allocated memory is still 137.4 MB. Free memory was 84.7 MB in the beginning and 75.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2019-09-03 20:20:52,657 INFO L168 Benchmark]: Boogie Preprocessor took 191.37 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 75.0 MB in the beginning and 176.6 MB in the end (delta: -101.6 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2019-09-03 20:20:52,663 INFO L168 Benchmark]: RCFGBuilder took 271.67 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 163.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2019-09-03 20:20:52,664 INFO L168 Benchmark]: TraceAbstraction took 85447.12 ms. Allocated memory was 199.8 MB in the beginning and 378.0 MB in the end (delta: 178.3 MB). Free memory was 163.3 MB in the beginning and 269.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 264.9 MB. Max. memory is 7.1 GB. [2019-09-03 20:20:52,672 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 103.3 MB in the beginning and 103.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.87 ms. Allocated memory is still 137.4 MB. Free memory was 84.7 MB in the beginning and 75.0 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 191.37 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 75.0 MB in the beginning and 176.6 MB in the end (delta: -101.6 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 271.67 ms. Allocated memory is still 199.8 MB. Free memory was 176.6 MB in the beginning and 163.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85447.12 ms. Allocated memory was 199.8 MB in the beginning and 378.0 MB in the end (delta: 178.3 MB). Free memory was 163.3 MB in the beginning and 269.0 MB in the end (delta: -105.7 MB). Peak memory consumption was 264.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant [2019-09-03 20:20:52,681 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,683 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,692 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-03 20:20:52,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-03 20:20:52,693 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] Derived loop invariant: ((((((p == 1 && 1 <= y) && q == 0) && y <= b) && q + p * (b * a) == y * x) && a == x) || (((1 <= y && (\exists v_main_~a~0_38 : int, v_main_~b~0_44 : int :: (((a == v_main_~a~0_38 / 2 && v_main_~b~0_44 % 2 == 0) && b == v_main_~b~0_44 / 2) && 0 == v_main_~a~0_38 % 2) && y * x == p / 4 * (v_main_~a~0_38 * v_main_~b~0_44) + q)) && 1 <= b) && 0 == p % 4)) || (((!(0 == (a + 1) % 2) && 0 <= b) && 1 <= y) && q + p * (b * a) == y * x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 85.3s OverallTime, 29 OverallIterations, 6 TraceHistogramMax, 63.0s AutomataDifference, 0.0s DeadEndRemovalTime, 9.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 504 SDtfs, 450 SDslu, 1982 SDs, 0 SdLazy, 3839 SolverSat, 156 SolverUnsat, 159 SolverUnknown, 0 SolverNotchecked, 58.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 816 GetRequests, 554 SyntacticMatches, 0 SemanticMatches, 262 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 13.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=19, 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.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 199 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 86 PreInvPairs, 134 NumberOfFragments, 264 HoareAnnotationTreeSize, 86 FomulaSimplifications, 61651 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 7299 FormulaSimplificationTreeSizeReductionInter, 9.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 784 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 755 ConstructedInterpolants, 63 QuantifiedInterpolants, 171914 SizeOfPredicates, 100 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 594 ConjunctsInUnsatCore, 29 InterpolantComputations, 5 PerfectInterpolantSequences, 400/540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...