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-112bae1 [2019-09-08 03:26:46,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:26:46,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:26:46,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:26:46,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:26:46,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:26:46,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:26:46,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:26:46,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:26:46,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:26:46,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:26:46,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:26:46,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:26:46,605 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:26:46,606 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:26:46,607 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:26:46,608 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:26:46,609 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:26:46,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:26:46,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:26:46,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:26:46,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:26:46,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:26:46,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:26:46,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:26:46,619 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:26:46,619 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:26:46,620 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:26:46,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:26:46,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:26:46,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:26:46,622 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:26:46,623 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:26:46,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:26:46,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:26:46,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:26:46,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:26:46,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:26:46,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:26:46,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:26:46,628 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:26:46,629 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:26:46,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:26:46,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:26:46,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:26:46,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:26:46,644 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:26:46,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:26:46,644 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:26:46,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:26:46,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:26:46,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:26:46,647 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:26:46,647 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:26:46,647 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:26:46,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:26:46,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:26:46,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:26:46,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:26:46,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:26:46,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:26:46,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:26:46,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:26:46,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:26:46,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:26:46,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:26:46,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:26:46,650 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:26:46,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:26:46,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:26:46,650 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:26:46,683 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:26:46,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:26:46,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:26:46,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:26:46,700 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:26:46,701 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-08 03:26:46,758 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840bda7d9/b3bb2bab3da24f15902cbe4b205ebeb7/FLAGfba1f5faa [2019-09-08 03:26:47,189 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:26:47,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prod4br.c [2019-09-08 03:26:47,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840bda7d9/b3bb2bab3da24f15902cbe4b205ebeb7/FLAGfba1f5faa [2019-09-08 03:26:47,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/840bda7d9/b3bb2bab3da24f15902cbe4b205ebeb7 [2019-09-08 03:26:47,590 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:26:47,591 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:26:47,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:26:47,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:26:47,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:26:47,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,599 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@277c7fe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47, skipping insertion in model container [2019-09-08 03:26:47,599 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:26:47,621 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:26:47,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:26:47,794 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:26:47,817 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:26:47,831 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:26:47,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47 WrapperNode [2019-09-08 03:26:47,832 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:26:47,833 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:26:47,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:26:47,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:26:47,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,945 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... [2019-09-08 03:26:47,948 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:26:47,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:26:47,949 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:26:47,949 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:26:47,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:26:47,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:26:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:26:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-08 03:26:47,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:26:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:26:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:26:47,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 03:26:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-08 03:26:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:26:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:26:47,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:26:48,211 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:26:48,212 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 03:26:48,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:26:48 BoogieIcfgContainer [2019-09-08 03:26:48,214 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:26:48,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:26:48,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:26:48,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:26:48,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:26:47" (1/3) ... [2019-09-08 03:26:48,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519a9434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:26:48, skipping insertion in model container [2019-09-08 03:26:48,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:47" (2/3) ... [2019-09-08 03:26:48,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@519a9434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:26:48, skipping insertion in model container [2019-09-08 03:26:48,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:26:48" (3/3) ... [2019-09-08 03:26:48,223 INFO L109 eAbstractionObserver]: Analyzing ICFG prod4br.c [2019-09-08 03:26:48,234 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:26:48,242 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:26:48,260 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:26:48,295 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:26:48,296 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:26:48,296 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:26:48,296 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:26:48,296 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:26:48,297 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:26:48,297 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:26:48,297 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:26:48,297 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:26:48,323 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-09-08 03:26:48,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 03:26:48,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:48,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:48,334 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:48,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash 152624894, now seen corresponding path program 1 times [2019-09-08 03:26:48,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:48,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:48,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:48,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:48,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:26:48,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:26:48,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 03:26:48,446 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 03:26:48,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 03:26:48,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 03:26:48,459 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2019-09-08 03:26:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:48,482 INFO L93 Difference]: Finished difference Result 43 states and 62 transitions. [2019-09-08 03:26:48,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 03:26:48,484 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-08 03:26:48,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:48,493 INFO L225 Difference]: With dead ends: 43 [2019-09-08 03:26:48,494 INFO L226 Difference]: Without dead ends: 19 [2019-09-08 03:26:48,497 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 03:26:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-09-08 03:26:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-09-08 03:26:48,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-09-08 03:26:48,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-09-08 03:26:48,537 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2019-09-08 03:26:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:48,538 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-09-08 03:26:48,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 03:26:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-09-08 03:26:48,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-08 03:26:48,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:48,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:48,540 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash 130400808, now seen corresponding path program 1 times [2019-09-08 03:26:48,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:48,550 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:48,550 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:48,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:26:48,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:48,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 03:26:48,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:48,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 03:26:48,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:26:48,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:26:48,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:26:48,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:26:48,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:26:48,709 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 5 states. [2019-09-08 03:26:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:48,817 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2019-09-08 03:26:48,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:26:48,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-09-08 03:26:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:48,819 INFO L225 Difference]: With dead ends: 33 [2019-09-08 03:26:48,820 INFO L226 Difference]: Without dead ends: 31 [2019-09-08 03:26:48,821 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-08 03:26:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-08 03:26:48,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2019-09-08 03:26:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-08 03:26:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-09-08 03:26:48,831 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 10 [2019-09-08 03:26:48,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:48,832 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-09-08 03:26:48,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:26:48,832 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-09-08 03:26:48,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-08 03:26:48,833 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:48,833 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:48,834 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:48,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:48,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1836845457, now seen corresponding path program 1 times [2019-09-08 03:26:48,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:48,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:48,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:48,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:48,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:48,842 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:48,842 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:48,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:26:48,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:26:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:48,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:26:48,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:48,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:48,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:49,032 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-08 03:26:49,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:26:49,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 03:26:49,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:26:49,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:26:49,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:26:49,039 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 9 states. [2019-09-08 03:26:49,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:49,506 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-09-08 03:26:49,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:26:49,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-09-08 03:26:49,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:49,510 INFO L225 Difference]: With dead ends: 39 [2019-09-08 03:26:49,510 INFO L226 Difference]: Without dead ends: 37 [2019-09-08 03:26:49,511 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-08 03:26:49,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-08 03:26:49,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-08 03:26:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 03:26:49,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2019-09-08 03:26:49,521 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 16 [2019-09-08 03:26:49,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:49,521 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-09-08 03:26:49,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:26:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2019-09-08 03:26:49,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 03:26:49,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:49,523 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:49,523 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:49,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:49,524 INFO L82 PathProgramCache]: Analyzing trace with hash 682822634, now seen corresponding path program 1 times [2019-09-08 03:26:49,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:49,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:49,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:49,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:49,532 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:49,532 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:49,532 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:26:49,549 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-08 03:26:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:49,581 WARN L254 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:26:49,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:49,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:49,751 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-08 03:26:49,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:26:49,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 03:26:49,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:26:49,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:26:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:26:49,757 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand 9 states. [2019-09-08 03:26:50,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:50,127 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2019-09-08 03:26:50,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:26:50,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-09-08 03:26:50,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:50,129 INFO L225 Difference]: With dead ends: 55 [2019-09-08 03:26:50,129 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 03:26:50,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:26:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 03:26:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2019-09-08 03:26:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-08 03:26:50,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-09-08 03:26:50,141 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 18 [2019-09-08 03:26:50,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:50,141 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-09-08 03:26:50,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:26:50,142 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2019-09-08 03:26:50,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-08 03:26:50,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:50,143 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:50,143 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:50,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:50,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1827366173, now seen corresponding path program 1 times [2019-09-08 03:26:50,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:50,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:50,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:50,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:50,149 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:50,150 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:50,150 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) [2019-09-08 03:26:50,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:26:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:50,179 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:26:50,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:50,268 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-08 03:26:50,310 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-08 03:26:50,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:50,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-09-08 03:26:50,404 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-08 03:26:50,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:26:50,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:26:50,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:26:50,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:26:50,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=43, Unknown=2, NotChecked=26, Total=90 [2019-09-08 03:26:50,410 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand 10 states. [2019-09-08 03:26:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:50,626 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-09-08 03:26:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:26:50,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-09-08 03:26:50,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:50,628 INFO L225 Difference]: With dead ends: 55 [2019-09-08 03:26:50,628 INFO L226 Difference]: Without dead ends: 53 [2019-09-08 03:26:50,628 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-08 03:26:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-08 03:26:50,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-09-08 03:26:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-08 03:26:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-08 03:26:50,640 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 19 [2019-09-08 03:26:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:50,640 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-08 03:26:50,641 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:26:50,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-08 03:26:50,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 03:26:50,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:50,642 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:50,642 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:50,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash 560958013, now seen corresponding path program 1 times [2019-09-08 03:26:50,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:50,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:50,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:50,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:50,649 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:50,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:50,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:26:50,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:50,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:26:50,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:26:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 03:26:50,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:26:50,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:26:50,719 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:26:50,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:26:50,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:26:50,720 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2019-09-08 03:26:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:50,811 INFO L93 Difference]: Finished difference Result 64 states and 81 transitions. [2019-09-08 03:26:50,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:26:50,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-08 03:26:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:50,813 INFO L225 Difference]: With dead ends: 64 [2019-09-08 03:26:50,813 INFO L226 Difference]: Without dead ends: 52 [2019-09-08 03:26:50,814 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-08 03:26:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-08 03:26:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-09-08 03:26:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-08 03:26:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2019-09-08 03:26:50,825 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 21 [2019-09-08 03:26:50,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:50,825 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2019-09-08 03:26:50,825 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:26:50,826 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2019-09-08 03:26:50,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 03:26:50,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:50,827 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:50,827 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:50,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1203344027, now seen corresponding path program 1 times [2019-09-08 03:26:50,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:50,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:50,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:50,834 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:50,834 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:50,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:26:50,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:50,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 03:26:50,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:51,061 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2019-09-08 03:26:51,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:51,094 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-08 03:26:51,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:26:51,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 03:26:51,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:26:51,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:26:51,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:26:51,101 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand 9 states. [2019-09-08 03:26:51,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:51,456 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2019-09-08 03:26:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:26:51,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-09-08 03:26:51,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:51,458 INFO L225 Difference]: With dead ends: 78 [2019-09-08 03:26:51,458 INFO L226 Difference]: Without dead ends: 64 [2019-09-08 03:26:51,459 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-08 03:26:51,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-08 03:26:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-09-08 03:26:51,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-08 03:26:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2019-09-08 03:26:51,478 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 20 [2019-09-08 03:26:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:51,478 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2019-09-08 03:26:51,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:26:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2019-09-08 03:26:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 03:26:51,482 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:51,482 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:51,482 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:51,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1146085725, now seen corresponding path program 1 times [2019-09-08 03:26:51,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:51,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:51,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:51,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:51,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:51,500 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:51,500 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:51,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:26:51,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:51,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-08 03:26:51,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:51,963 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2019-09-08 03:26:51,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:52,029 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-08 03:26:52,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:26:52,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:26:52,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:26:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:26:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:26:52,033 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand 10 states. [2019-09-08 03:26:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:26:52,832 INFO L93 Difference]: Finished difference Result 88 states and 118 transitions. [2019-09-08 03:26:52,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:26:52,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-09-08 03:26:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:26:52,835 INFO L225 Difference]: With dead ends: 88 [2019-09-08 03:26:52,835 INFO L226 Difference]: Without dead ends: 74 [2019-09-08 03:26:52,836 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-08 03:26:52,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-09-08 03:26:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2019-09-08 03:26:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 03:26:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2019-09-08 03:26:52,848 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 20 [2019-09-08 03:26:52,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:26:52,848 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2019-09-08 03:26:52,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:26:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2019-09-08 03:26:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-08 03:26:52,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:26:52,849 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:26:52,850 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:26:52,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:26:52,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1259300529, now seen corresponding path program 1 times [2019-09-08 03:26:52,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:26:52,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:26:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:52,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:52,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:26:52,855 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:26:52,856 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:26:52,856 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-08 03:26:52,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:26:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:26:52,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 03:26:52,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:26:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:52,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:52,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:52,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:53,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:54,532 WARN L188 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2019-09-08 03:26:54,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:26:54,560 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-08 03:26:54,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:26:54,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:26:54,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:26:54,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:26:54,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=69, Unknown=2, NotChecked=0, Total=90 [2019-09-08 03:26:54,570 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand 10 states. [2019-09-08 03:27:00,667 WARN L188 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-09-08 03:27:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:13,335 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-09-08 03:27:13,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:27:13,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2019-09-08 03:27:13,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:13,337 INFO L225 Difference]: With dead ends: 85 [2019-09-08 03:27:13,337 INFO L226 Difference]: Without dead ends: 78 [2019-09-08 03:27:13,338 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=45, Invalid=163, Unknown=2, NotChecked=0, Total=210 [2019-09-08 03:27:13,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-08 03:27:13,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-08 03:27:13,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-08 03:27:13,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 101 transitions. [2019-09-08 03:27:13,352 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 101 transitions. Word has length 24 [2019-09-08 03:27:13,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:13,352 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 101 transitions. [2019-09-08 03:27:13,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 101 transitions. [2019-09-08 03:27:13,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 03:27:13,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:13,354 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:27:13,355 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash -333220948, now seen corresponding path program 2 times [2019-09-08 03:27:13,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:13,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:13,360 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:13,360 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:13,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:13,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:13,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:13,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:13,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-08 03:27:13,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:13,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,791 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-09-08 03:27:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:13,822 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-08 03:27:13,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:13,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:13,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:13,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:13,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2019-09-08 03:27:13,825 INFO L87 Difference]: Start difference. First operand 77 states and 101 transitions. Second operand 10 states. [2019-09-08 03:27:14,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:14,372 INFO L93 Difference]: Finished difference Result 94 states and 125 transitions. [2019-09-08 03:27:14,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:14,373 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-08 03:27:14,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:14,374 INFO L225 Difference]: With dead ends: 94 [2019-09-08 03:27:14,375 INFO L226 Difference]: Without dead ends: 92 [2019-09-08 03:27:14,375 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-08 03:27:14,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-08 03:27:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2019-09-08 03:27:14,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-09-08 03:27:14,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-09-08 03:27:14,387 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 26 [2019-09-08 03:27:14,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:14,387 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-09-08 03:27:14,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:14,388 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-09-08 03:27:14,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 03:27:14,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:14,389 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-08 03:27:14,389 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:14,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:14,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1198817260, now seen corresponding path program 1 times [2019-09-08 03:27:14,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:14,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:14,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:14,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:14,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:14,394 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:14,394 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:14,395 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-08 03:27:14,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:14,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:14,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:27:14,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:14,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:14,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:14,538 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-08 03:27:14,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:14,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:14,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:14,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:14,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:14,542 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 10 states. [2019-09-08 03:27:15,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:15,323 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2019-09-08 03:27:15,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:27:15,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-08 03:27:15,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:15,326 INFO L225 Difference]: With dead ends: 110 [2019-09-08 03:27:15,326 INFO L226 Difference]: Without dead ends: 107 [2019-09-08 03:27:15,327 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-08 03:27:15,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-08 03:27:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2019-09-08 03:27:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-08 03:27:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2019-09-08 03:27:15,337 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 26 [2019-09-08 03:27:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:15,338 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2019-09-08 03:27:15,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2019-09-08 03:27:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 03:27:15,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:15,339 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-08 03:27:15,339 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:15,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:15,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1456982698, now seen corresponding path program 1 times [2019-09-08 03:27:15,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:15,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:15,344 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:15,344 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:15,344 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:15,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:15,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 03:27:15,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:15,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:15,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:15,457 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-08 03:27:15,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:15,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:15,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:15,462 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand 10 states. [2019-09-08 03:27:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:16,427 INFO L93 Difference]: Finished difference Result 118 states and 153 transitions. [2019-09-08 03:27:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:27:16,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-09-08 03:27:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:16,432 INFO L225 Difference]: With dead ends: 118 [2019-09-08 03:27:16,432 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 03:27:16,433 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=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:27:16,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 03:27:16,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-09-08 03:27:16,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-08 03:27:16,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 133 transitions. [2019-09-08 03:27:16,444 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 133 transitions. Word has length 26 [2019-09-08 03:27:16,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:16,445 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 133 transitions. [2019-09-08 03:27:16,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:16,445 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 133 transitions. [2019-09-08 03:27:16,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 03:27:16,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:16,446 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:27:16,446 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:16,447 INFO L82 PathProgramCache]: Analyzing trace with hash 394786203, now seen corresponding path program 1 times [2019-09-08 03:27:16,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:16,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:16,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:16,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:16,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:16,451 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:16,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:16,451 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:16,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:16,485 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 03:27:16,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:17,065 WARN L188 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 38 [2019-09-08 03:27:17,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,102 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-08 03:27:17,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:17,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:17,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:17,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:17,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:17,106 INFO L87 Difference]: Start difference. First operand 101 states and 133 transitions. Second operand 10 states. [2019-09-08 03:27:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:17,739 INFO L93 Difference]: Finished difference Result 147 states and 198 transitions. [2019-09-08 03:27:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:17,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-09-08 03:27:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:17,742 INFO L225 Difference]: With dead ends: 147 [2019-09-08 03:27:17,743 INFO L226 Difference]: Without dead ends: 111 [2019-09-08 03:27:17,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:27:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-08 03:27:17,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-08 03:27:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-08 03:27:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 143 transitions. [2019-09-08 03:27:17,756 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 143 transitions. Word has length 27 [2019-09-08 03:27:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:17,757 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 143 transitions. [2019-09-08 03:27:17,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:17,757 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 143 transitions. [2019-09-08 03:27:17,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 03:27:17,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:17,758 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:27:17,759 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:17,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:17,759 INFO L82 PathProgramCache]: Analyzing trace with hash -862656033, now seen corresponding path program 2 times [2019-09-08 03:27:17,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:17,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:17,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:17,764 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:17,764 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:17,764 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:17,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:17,805 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:17,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:17,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:27:17,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:17,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:17,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:18,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:18,111 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-08 03:27:18,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:18,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-08 03:27:18,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:27:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:27:18,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:27:18,116 INFO L87 Difference]: Start difference. First operand 110 states and 143 transitions. Second operand 11 states. [2019-09-08 03:27:18,252 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-08 03:27:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:18,684 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2019-09-08 03:27:18,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:27:18,685 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2019-09-08 03:27:18,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:18,687 INFO L225 Difference]: With dead ends: 122 [2019-09-08 03:27:18,687 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 03:27:18,687 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2019-09-08 03:27:18,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 03:27:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2019-09-08 03:27:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-08 03:27:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 149 transitions. [2019-09-08 03:27:18,699 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 149 transitions. Word has length 27 [2019-09-08 03:27:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:18,699 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 149 transitions. [2019-09-08 03:27:18,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:27:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 149 transitions. [2019-09-08 03:27:18,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 03:27:18,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:18,700 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-08 03:27:18,701 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:18,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:18,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1631317159, now seen corresponding path program 1 times [2019-09-08 03:27:18,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:18,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:18,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:18,705 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:18,705 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:18,706 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-08 03:27:18,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:18,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-08 03:27:18,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:19,023 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 35 [2019-09-08 03:27:19,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:19,073 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-08 03:27:19,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:19,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:19,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:19,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:19,085 INFO L87 Difference]: Start difference. First operand 116 states and 149 transitions. Second operand 10 states. [2019-09-08 03:27:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:20,316 INFO L93 Difference]: Finished difference Result 151 states and 198 transitions. [2019-09-08 03:27:20,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:20,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-08 03:27:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:20,317 INFO L225 Difference]: With dead ends: 151 [2019-09-08 03:27:20,317 INFO L226 Difference]: Without dead ends: 129 [2019-09-08 03:27:20,318 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-08 03:27:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-08 03:27:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-09-08 03:27:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-08 03:27:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 163 transitions. [2019-09-08 03:27:20,330 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 163 transitions. Word has length 28 [2019-09-08 03:27:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:20,330 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 163 transitions. [2019-09-08 03:27:20,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 163 transitions. [2019-09-08 03:27:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 03:27:20,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:20,332 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-08 03:27:20,332 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1688575461, now seen corresponding path program 1 times [2019-09-08 03:27:20,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:20,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:20,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:20,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:20,336 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:20,337 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:20,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:20,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:20,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-08 03:27:20,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:20,671 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 33 [2019-09-08 03:27:20,959 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 38 [2019-09-08 03:27:20,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:20,988 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-08 03:27:20,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:20,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-09-08 03:27:20,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:27:20,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:27:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:27:20,992 INFO L87 Difference]: Start difference. First operand 126 states and 163 transitions. Second operand 11 states. [2019-09-08 03:27:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:21,503 INFO L93 Difference]: Finished difference Result 160 states and 210 transitions. [2019-09-08 03:27:21,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:27:21,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-08 03:27:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:21,507 INFO L225 Difference]: With dead ends: 160 [2019-09-08 03:27:21,507 INFO L226 Difference]: Without dead ends: 138 [2019-09-08 03:27:21,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:27:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-08 03:27:21,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2019-09-08 03:27:21,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-08 03:27:21,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 171 transitions. [2019-09-08 03:27:21,521 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 171 transitions. Word has length 28 [2019-09-08 03:27:21,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:21,521 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 171 transitions. [2019-09-08 03:27:21,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:27:21,521 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 171 transitions. [2019-09-08 03:27:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 03:27:21,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:21,522 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-08 03:27:21,522 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:21,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:21,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1671899687, now seen corresponding path program 2 times [2019-09-08 03:27:21,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:21,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:21,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:21,527 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:21,527 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:21,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 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-08 03:27:21,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:21,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:21,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:21,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-08 03:27:21,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:21,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:21,772 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-08 03:27:21,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:21,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:21,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:21,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:21,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:21,777 INFO L87 Difference]: Start difference. First operand 133 states and 171 transitions. Second operand 10 states. [2019-09-08 03:27:24,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:24,858 INFO L93 Difference]: Finished difference Result 175 states and 231 transitions. [2019-09-08 03:27:24,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:24,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-08 03:27:24,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:24,868 INFO L225 Difference]: With dead ends: 175 [2019-09-08 03:27:24,868 INFO L226 Difference]: Without dead ends: 148 [2019-09-08 03:27:24,869 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-08 03:27:24,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-08 03:27:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2019-09-08 03:27:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-09-08 03:27:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 176 transitions. [2019-09-08 03:27:24,887 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 176 transitions. Word has length 28 [2019-09-08 03:27:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:24,888 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 176 transitions. [2019-09-08 03:27:24,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 176 transitions. [2019-09-08 03:27:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 03:27:24,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:24,889 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-08 03:27:24,890 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:24,890 INFO L82 PathProgramCache]: Analyzing trace with hash 660782437, now seen corresponding path program 2 times [2019-09-08 03:27:24,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:24,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:24,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:24,901 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:24,901 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:24,901 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-08 03:27:24,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:24,927 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:24,927 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:24,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-08 03:27:24,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:24,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:24,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:24,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:25,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:25,121 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-08 03:27:25,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:25,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:25,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:25,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:25,126 INFO L87 Difference]: Start difference. First operand 139 states and 176 transitions. Second operand 10 states. [2019-09-08 03:27:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:27,636 INFO L93 Difference]: Finished difference Result 174 states and 226 transitions. [2019-09-08 03:27:27,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:27,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-09-08 03:27:27,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:27,639 INFO L225 Difference]: With dead ends: 174 [2019-09-08 03:27:27,639 INFO L226 Difference]: Without dead ends: 172 [2019-09-08 03:27:27,640 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-08 03:27:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-09-08 03:27:27,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 143. [2019-09-08 03:27:27,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-08 03:27:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2019-09-08 03:27:27,653 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 28 [2019-09-08 03:27:27,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:27,653 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2019-09-08 03:27:27,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2019-09-08 03:27:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-08 03:27:27,654 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:27,655 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-08 03:27:27,655 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:27,655 INFO L82 PathProgramCache]: Analyzing trace with hash -349658598, now seen corresponding path program 1 times [2019-09-08 03:27:27,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:27,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:27,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:27,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:27,659 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:27,659 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:27,659 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:27,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:27,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:27:27,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:27:27,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:27:27,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 03:27:27,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 03:27:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 03:27:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 03:27:27,711 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 3 states. [2019-09-08 03:27:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:27,747 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2019-09-08 03:27:27,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 03:27:27,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-08 03:27:27,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:27,749 INFO L225 Difference]: With dead ends: 182 [2019-09-08 03:27:27,749 INFO L226 Difference]: Without dead ends: 155 [2019-09-08 03:27:27,749 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-08 03:27:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-08 03:27:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 148. [2019-09-08 03:27:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 03:27:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 190 transitions. [2019-09-08 03:27:27,762 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 190 transitions. Word has length 29 [2019-09-08 03:27:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:27,762 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 190 transitions. [2019-09-08 03:27:27,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 03:27:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 190 transitions. [2019-09-08 03:27:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 03:27:27,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:27,764 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-08 03:27:27,764 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:27,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1615173920, now seen corresponding path program 1 times [2019-09-08 03:27:27,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:27,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:27,768 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:27,768 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:27,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:27:27,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:27,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:27:27,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:27,822 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-08 03:27:27,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:27:27,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:27:27,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:27:27,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:27:27,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:27:27,826 INFO L87 Difference]: Start difference. First operand 148 states and 190 transitions. Second operand 6 states. [2019-09-08 03:27:27,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:27,904 INFO L93 Difference]: Finished difference Result 156 states and 198 transitions. [2019-09-08 03:27:27,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:27:27,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-09-08 03:27:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:27,908 INFO L225 Difference]: With dead ends: 156 [2019-09-08 03:27:27,908 INFO L226 Difference]: Without dead ends: 148 [2019-09-08 03:27:27,908 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-08 03:27:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-09-08 03:27:27,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-09-08 03:27:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-08 03:27:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 187 transitions. [2019-09-08 03:27:27,932 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 187 transitions. Word has length 31 [2019-09-08 03:27:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:27,932 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 187 transitions. [2019-09-08 03:27:27,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:27:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 187 transitions. [2019-09-08 03:27:27,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 03:27:27,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:27,933 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-08 03:27:27,933 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:27,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:27,934 INFO L82 PathProgramCache]: Analyzing trace with hash 169189792, now seen corresponding path program 1 times [2019-09-08 03:27:27,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:27,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:27,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:27,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:27,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:27,938 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:27,938 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:27,938 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:27,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:27:27,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:28,029 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-08 03:27:28,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:28,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-09-08 03:27:28,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:27:28,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:27:28,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:27:28,033 INFO L87 Difference]: Start difference. First operand 148 states and 187 transitions. Second operand 5 states. [2019-09-08 03:27:28,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:28,114 INFO L93 Difference]: Finished difference Result 230 states and 304 transitions. [2019-09-08 03:27:28,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:27:28,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-09-08 03:27:28,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:28,116 INFO L225 Difference]: With dead ends: 230 [2019-09-08 03:27:28,116 INFO L226 Difference]: Without dead ends: 152 [2019-09-08 03:27:28,117 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-08 03:27:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-09-08 03:27:28,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2019-09-08 03:27:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-08 03:27:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2019-09-08 03:27:28,129 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 181 transitions. Word has length 30 [2019-09-08 03:27:28,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:28,129 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 181 transitions. [2019-09-08 03:27:28,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:27:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 181 transitions. [2019-09-08 03:27:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-08 03:27:28,130 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:28,131 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-08 03:27:28,131 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:28,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1091445474, now seen corresponding path program 1 times [2019-09-08 03:27:28,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:28,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:28,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:28,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:28,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:28,137 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:28,137 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:28,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 03:27:28,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:28,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 03:27:28,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:28,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:28,202 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:27:28,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:28,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-09-08 03:27:28,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:27:28,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:27:28,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:27:28,207 INFO L87 Difference]: Start difference. First operand 146 states and 181 transitions. Second operand 7 states. [2019-09-08 03:27:28,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:28,300 INFO L93 Difference]: Finished difference Result 154 states and 189 transitions. [2019-09-08 03:27:28,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:27:28,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-08 03:27:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:28,304 INFO L225 Difference]: With dead ends: 154 [2019-09-08 03:27:28,304 INFO L226 Difference]: Without dead ends: 141 [2019-09-08 03:27:28,304 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-08 03:27:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-08 03:27:28,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2019-09-08 03:27:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-09-08 03:27:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 148 transitions. [2019-09-08 03:27:28,320 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 148 transitions. Word has length 31 [2019-09-08 03:27:28,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:28,320 INFO L475 AbstractCegarLoop]: Abstraction has 121 states and 148 transitions. [2019-09-08 03:27:28,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:27:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 148 transitions. [2019-09-08 03:27:28,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 03:27:28,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:28,321 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-08 03:27:28,322 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash -909136864, now seen corresponding path program 2 times [2019-09-08 03:27:28,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:28,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:28,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:28,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:28,331 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:28,331 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:28,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:28,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:28,361 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:28,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:28,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-08 03:27:28,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:30,708 WARN L188 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2019-09-08 03:27:30,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:30,734 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-08 03:27:30,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:30,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:30,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:30,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:30,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:30,737 INFO L87 Difference]: Start difference. First operand 121 states and 148 transitions. Second operand 10 states. [2019-09-08 03:27:31,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:31,016 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2019-09-08 03:27:31,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:31,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-09-08 03:27:31,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:31,017 INFO L225 Difference]: With dead ends: 132 [2019-09-08 03:27:31,017 INFO L226 Difference]: Without dead ends: 130 [2019-09-08 03:27:31,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:27:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-08 03:27:31,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2019-09-08 03:27:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-09-08 03:27:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 151 transitions. [2019-09-08 03:27:31,028 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 151 transitions. Word has length 30 [2019-09-08 03:27:31,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:31,028 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 151 transitions. [2019-09-08 03:27:31,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2019-09-08 03:27:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 03:27:31,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:31,029 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:27:31,029 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:31,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash -851878562, now seen corresponding path program 2 times [2019-09-08 03:27:31,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:31,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:31,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:31,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:31,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:31,033 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:31,033 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:31,034 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-08 03:27:31,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:31,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:31,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:31,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:27:31,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:31,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 03:27:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 03:27:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 03:27:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,242 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-08 03:27:31,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:31,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-08 03:27:31,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:27:31,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:27:31,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:27:31,246 INFO L87 Difference]: Start difference. First operand 123 states and 151 transitions. Second operand 6 states. [2019-09-08 03:27:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:31,331 INFO L93 Difference]: Finished difference Result 166 states and 214 transitions. [2019-09-08 03:27:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:27:31,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-08 03:27:31,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:31,332 INFO L225 Difference]: With dead ends: 166 [2019-09-08 03:27:31,332 INFO L226 Difference]: Without dead ends: 130 [2019-09-08 03:27:31,333 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-08 03:27:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-08 03:27:31,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2019-09-08 03:27:31,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-08 03:27:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2019-09-08 03:27:31,343 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 30 [2019-09-08 03:27:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:31,343 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2019-09-08 03:27:31,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:27:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2019-09-08 03:27:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 03:27:31,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:31,344 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:27:31,344 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:31,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:31,344 INFO L82 PathProgramCache]: Analyzing trace with hash 605616494, now seen corresponding path program 3 times [2019-09-08 03:27:31,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:31,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:31,347 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:31,348 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:31,348 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) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:31,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:27:31,369 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 03:27:31,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:31,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 03:27:31,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,973 WARN L188 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 32 [2019-09-08 03:27:31,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:31,991 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-08 03:27:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 03:27:31,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:27:31,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:27:31,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:27:31,996 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand 9 states. [2019-09-08 03:27:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:34,884 INFO L93 Difference]: Finished difference Result 110 states and 127 transitions. [2019-09-08 03:27:34,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:27:34,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-09-08 03:27:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:34,886 INFO L225 Difference]: With dead ends: 110 [2019-09-08 03:27:34,886 INFO L226 Difference]: Without dead ends: 106 [2019-09-08 03:27:34,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:27:34,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-08 03:27:34,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-09-08 03:27:34,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-09-08 03:27:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2019-09-08 03:27:34,897 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 34 [2019-09-08 03:27:34,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:34,897 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2019-09-08 03:27:34,897 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:27:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2019-09-08 03:27:34,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 03:27:34,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:34,898 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-08 03:27:34,899 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:34,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:34,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1899147156, now seen corresponding path program 1 times [2019-09-08 03:27:34,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:34,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:34,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:34,902 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:34,902 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:34,903 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) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:34,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:34,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:34,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 03:27:34,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:34,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:34,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:35,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:35,158 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:27:35,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:35,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-09-08 03:27:35,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:27:35,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:27:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:27:35,164 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand 12 states. [2019-09-08 03:27:38,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:38,004 INFO L93 Difference]: Finished difference Result 128 states and 151 transitions. [2019-09-08 03:27:38,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:27:38,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2019-09-08 03:27:38,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:38,006 INFO L225 Difference]: With dead ends: 128 [2019-09-08 03:27:38,007 INFO L226 Difference]: Without dead ends: 123 [2019-09-08 03:27:38,007 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-08 03:27:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-08 03:27:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 110. [2019-09-08 03:27:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-08 03:27:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2019-09-08 03:27:38,019 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 34 [2019-09-08 03:27:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:38,019 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2019-09-08 03:27:38,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:27:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2019-09-08 03:27:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 03:27:38,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:38,020 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-08 03:27:38,020 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2036294560, now seen corresponding path program 1 times [2019-09-08 03:27:38,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:38,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:38,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:38,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:38,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:38,024 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:38,024 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:38,025 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-08 03:27:38,041 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-08 03:27:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:27:38,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:27:38,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:38,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:38,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:38,178 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-08 03:27:38,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:38,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-09-08 03:27:38,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:27:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:27:38,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:27:38,182 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand 10 states. [2019-09-08 03:27:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:40,537 INFO L93 Difference]: Finished difference Result 121 states and 141 transitions. [2019-09-08 03:27:40,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:27:40,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-09-08 03:27:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:40,539 INFO L225 Difference]: With dead ends: 121 [2019-09-08 03:27:40,539 INFO L226 Difference]: Without dead ends: 116 [2019-09-08 03:27:40,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-08 03:27:40,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-08 03:27:40,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2019-09-08 03:27:40,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-09-08 03:27:40,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2019-09-08 03:27:40,551 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 41 [2019-09-08 03:27:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:40,552 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2019-09-08 03:27:40,552 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:27:40,552 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2019-09-08 03:27:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-08 03:27:40,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:40,553 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-08 03:27:40,553 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:40,553 INFO L82 PathProgramCache]: Analyzing trace with hash -347474898, now seen corresponding path program 2 times [2019-09-08 03:27:40,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:40,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:27:40,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:40,557 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:40,557 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:40,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-08 03:27:40,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 03:27:40,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 03:27:40,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:40,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-08 03:27:40,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:40,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:40,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:40,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:40,981 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-08 03:27:40,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-09-08 03:27:40,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:27:40,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:27:40,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:27:40,985 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand 14 states. [2019-09-08 03:27:43,013 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 33 DAG size of output: 16 [2019-09-08 03:27:51,520 WARN L188 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-09-08 03:27:54,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:54,316 INFO L93 Difference]: Finished difference Result 142 states and 171 transitions. [2019-09-08 03:27:54,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 03:27:54,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 42 [2019-09-08 03:27:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:54,318 INFO L225 Difference]: With dead ends: 142 [2019-09-08 03:27:54,318 INFO L226 Difference]: Without dead ends: 137 [2019-09-08 03:27:54,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=100, Invalid=360, Unknown=2, NotChecked=0, Total=462 [2019-09-08 03:27:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-08 03:27:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 118. [2019-09-08 03:27:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-09-08 03:27:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 140 transitions. [2019-09-08 03:27:54,330 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 140 transitions. Word has length 42 [2019-09-08 03:27:54,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:54,330 INFO L475 AbstractCegarLoop]: Abstraction has 118 states and 140 transitions. [2019-09-08 03:27:54,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:27:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 140 transitions. [2019-09-08 03:27:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 03:27:54,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:27:54,331 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-08 03:27:54,331 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:27:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:27:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash -95439376, now seen corresponding path program 3 times [2019-09-08 03:27:54,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:27:54,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:27:54,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:54,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 03:27:54,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:27:54,335 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 03:27:54,335 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 03:27:54,335 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-08 03:27:54,347 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 03:27:54,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 03:27:54,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 03:27:54,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:27:54,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:27:54,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:54,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 03:27:54,414 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-08 03:27:54,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:27:54,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-09-08 03:27:54,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:27:54,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:27:54,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:27:54,418 INFO L87 Difference]: Start difference. First operand 118 states and 140 transitions. Second operand 9 states. [2019-09-08 03:27:58,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:27:58,685 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2019-09-08 03:27:58,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:27:58,685 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-09-08 03:27:58,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:27:58,686 INFO L225 Difference]: With dead ends: 118 [2019-09-08 03:27:58,686 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 03:27:58,687 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-08 03:27:58,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 03:27:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 03:27:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 03:27:58,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 03:27:58,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-09-08 03:27:58,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:27:58,688 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 03:27:58,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:27:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 03:27:58,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 03:27:58,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 03:27:58,847 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 179 [2019-09-08 03:28:09,792 WARN L188 SmtUtils]: Spent 10.73 s on a formula simplification. DAG size of input: 175 DAG size of output: 49 [2019-09-08 03:28:22,022 WARN L188 SmtUtils]: Spent 12.23 s on a formula simplification. DAG size of input: 175 DAG size of output: 49 [2019-09-08 03:28:22,224 WARN L188 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 17 [2019-09-08 03:28:22,580 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 23 [2019-09-08 03:28:22,583 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-09-08 03:28:22,583 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 03:28:22,583 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 03:28:22,584 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 03:28:22,584 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 03:28:22,584 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 03:28:22,584 INFO L443 ceAbstractionStarter]: For program point L33(lines 33 47) no Hoare annotation was computed. [2019-09-08 03:28:22,584 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-08 03:28:22,584 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 14 53) no Hoare annotation was computed. [2019-09-08 03:28:22,584 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-08 03:28:22,584 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 14 53) no Hoare annotation was computed. [2019-09-08 03:28:22,584 INFO L443 ceAbstractionStarter]: For program point L40(lines 40 47) no Hoare annotation was computed. [2019-09-08 03:28:22,585 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-08 03:28:22,585 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 14 53) the Hoare annotation is: true [2019-09-08 03:28:22,585 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-08 03:28:22,585 INFO L443 ceAbstractionStarter]: For program point L28-1(lines 27 48) no Hoare annotation was computed. [2019-09-08 03:28:22,585 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-09-08 03:28:22,585 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 47) no Hoare annotation was computed. [2019-09-08 03:28:22,585 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 6 12) the Hoare annotation is: true [2019-09-08 03:28:22,586 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2019-09-08 03:28:22,586 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 6 12) no Hoare annotation was computed. [2019-09-08 03:28:22,586 INFO L443 ceAbstractionStarter]: For program point L8(lines 8 9) no Hoare annotation was computed. [2019-09-08 03:28:22,586 INFO L443 ceAbstractionStarter]: For program point L7(lines 7 10) no Hoare annotation was computed. [2019-09-08 03:28:22,586 INFO L443 ceAbstractionStarter]: For program point L7-2(lines 6 12) no Hoare annotation was computed. [2019-09-08 03:28:22,593 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,594 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,595 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,607 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 03:28:22 BoogieIcfgContainer [2019-09-08 03:28:22,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 03:28:22,611 INFO L168 Benchmark]: Toolchain (without parser) took 95020.31 ms. Allocated memory was 135.3 MB in the beginning and 316.7 MB in the end (delta: 181.4 MB). Free memory was 90.2 MB in the beginning and 286.8 MB in the end (delta: -196.6 MB). Peak memory consumption was 205.1 MB. Max. memory is 7.1 GB. [2019-09-08 03:28:22,612 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 135.3 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-08 03:28:22,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.89 ms. Allocated memory is still 135.3 MB. Free memory was 89.8 MB in the beginning and 79.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-09-08 03:28:22,613 INFO L168 Benchmark]: Boogie Preprocessor took 115.32 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 79.7 MB in the beginning and 177.4 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-09-08 03:28:22,614 INFO L168 Benchmark]: RCFGBuilder took 265.71 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 164.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. [2019-09-08 03:28:22,614 INFO L168 Benchmark]: TraceAbstraction took 94394.32 ms. Allocated memory was 201.3 MB in the beginning and 316.7 MB in the end (delta: 115.3 MB). Free memory was 163.7 MB in the beginning and 286.8 MB in the end (delta: -123.1 MB). Peak memory consumption was 212.6 MB. Max. memory is 7.1 GB. [2019-09-08 03:28:22,617 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.17 ms. Allocated memory is still 135.3 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 240.89 ms. Allocated memory is still 135.3 MB. Free memory was 89.8 MB in the beginning and 79.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.32 ms. Allocated memory was 135.3 MB in the beginning and 201.3 MB in the end (delta: 66.1 MB). Free memory was 79.7 MB in the beginning and 177.4 MB in the end (delta: -97.7 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 265.71 ms. Allocated memory is still 201.3 MB. Free memory was 177.4 MB in the beginning and 164.6 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 94394.32 ms. Allocated memory was 201.3 MB in the beginning and 316.7 MB in the end (delta: 115.3 MB). Free memory was 163.7 MB in the beginning and 286.8 MB in the end (delta: -123.1 MB). Peak memory consumption was 212.6 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-08 03:28:22,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~b~0_44,QUANTIFIED] [2019-09-08 03:28:22,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~a~0_38,QUANTIFIED] [2019-09-08 03:28:22,628 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, 94.3s OverallTime, 29 OverallIterations, 6 TraceHistogramMax, 58.4s AutomataDifference, 0.0s DeadEndRemovalTime, 23.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 504 SDtfs, 450 SDslu, 1988 SDs, 0 SdLazy, 3865 SolverSat, 148 SolverUnsat, 157 SolverUnknown, 0 SolverNotchecked, 52.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 263 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 13.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred 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, 218 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 98 PreInvPairs, 143 NumberOfFragments, 264 HoareAnnotationTreeSize, 98 FomulaSimplifications, 69502 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16417 FormulaSimplificationTreeSizeReductionInter, 23.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.1s 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...