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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/nla-digbench/divbin.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c6af20d [2019-09-03 21:08:01,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-03 21:08:01,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-03 21:08:01,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-03 21:08:01,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-03 21:08:01,518 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-03 21:08:01,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-03 21:08:01,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-03 21:08:01,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-03 21:08:01,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-03 21:08:01,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-03 21:08:01,526 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-03 21:08:01,526 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-03 21:08:01,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-03 21:08:01,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-03 21:08:01,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-03 21:08:01,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-03 21:08:01,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-03 21:08:01,533 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-03 21:08:01,534 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-03 21:08:01,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-03 21:08:01,537 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-03 21:08:01,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-03 21:08:01,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-03 21:08:01,541 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-03 21:08:01,541 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-03 21:08:01,542 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-03 21:08:01,542 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-03 21:08:01,543 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-03 21:08:01,544 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-03 21:08:01,544 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-03 21:08:01,545 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-03 21:08:01,546 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-03 21:08:01,546 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-03 21:08:01,547 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-03 21:08:01,548 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-03 21:08:01,548 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-03 21:08:01,548 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-03 21:08:01,549 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-03 21:08:01,550 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-03 21:08:01,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-03 21:08:01,551 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-03 21:08:01,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-03 21:08:01,566 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-03 21:08:01,566 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-03 21:08:01,566 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-03 21:08:01,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-03 21:08:01,567 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-03 21:08:01,567 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-03 21:08:01,568 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-03 21:08:01,568 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-03 21:08:01,568 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-03 21:08:01,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-03 21:08:01,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-03 21:08:01,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-03 21:08:01,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-03 21:08:01,569 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-03 21:08:01,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-03 21:08:01,570 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-03 21:08:01,570 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-03 21:08:01,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-03 21:08:01,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-03 21:08:01,571 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-03 21:08:01,571 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-03 21:08:01,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-03 21:08:01,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:08:01,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-03 21:08:01,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-03 21:08:01,572 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-03 21:08:01,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-03 21:08:01,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-03 21:08:01,572 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-03 21:08:01,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-03 21:08:01,613 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-03 21:08:01,616 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-03 21:08:01,617 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-03 21:08:01,618 INFO L275 PluginConnector]: CDTParser initialized [2019-09-03 21:08:01,619 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin.c [2019-09-03 21:08:01,676 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bb59ee2/6a9f0d5a8b1542419650f1728e1722f6/FLAG63c4c698f [2019-09-03 21:08:02,069 INFO L306 CDTParser]: Found 1 translation units. [2019-09-03 21:08:02,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin.c [2019-09-03 21:08:02,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bb59ee2/6a9f0d5a8b1542419650f1728e1722f6/FLAG63c4c698f [2019-09-03 21:08:02,461 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5bb59ee2/6a9f0d5a8b1542419650f1728e1722f6 [2019-09-03 21:08:02,471 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-03 21:08:02,473 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-03 21:08:02,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-03 21:08:02,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-03 21:08:02,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-03 21:08:02,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e607a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02, skipping insertion in model container [2019-09-03 21:08:02,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,491 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-03 21:08:02,514 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-03 21:08:02,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:08:02,711 INFO L188 MainTranslator]: Completed pre-run [2019-09-03 21:08:02,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-03 21:08:02,743 INFO L192 MainTranslator]: Completed translation [2019-09-03 21:08:02,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02 WrapperNode [2019-09-03 21:08:02,744 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-03 21:08:02,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-03 21:08:02,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-03 21:08:02,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-03 21:08:02,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,857 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... [2019-09-03 21:08:02,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-03 21:08:02,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-03 21:08:02,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-03 21:08:02,871 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-03 21:08:02,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-03 21:08:02,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-03 21:08:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-03 21:08:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-03 21:08:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-03 21:08:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-03 21:08:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-03 21:08:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-03 21:08:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-03 21:08:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-03 21:08:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-03 21:08:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-03 21:08:03,121 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-03 21:08:03,122 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-03 21:08:03,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:08:03 BoogieIcfgContainer [2019-09-03 21:08:03,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-03 21:08:03,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-03 21:08:03,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-03 21:08:03,127 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-03 21:08:03,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.09 09:08:02" (1/3) ... [2019-09-03 21:08:03,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cec06c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:08:03, skipping insertion in model container [2019-09-03 21:08:03,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.09 09:08:02" (2/3) ... [2019-09-03 21:08:03,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cec06c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.09 09:08:03, skipping insertion in model container [2019-09-03 21:08:03,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.09 09:08:03" (3/3) ... [2019-09-03 21:08:03,131 INFO L109 eAbstractionObserver]: Analyzing ICFG divbin.c [2019-09-03 21:08:03,140 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-03 21:08:03,148 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-03 21:08:03,164 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-03 21:08:03,190 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-03 21:08:03,190 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-03 21:08:03,190 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-03 21:08:03,191 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-03 21:08:03,191 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-03 21:08:03,191 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-03 21:08:03,191 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-03 21:08:03,191 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-03 21:08:03,204 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-03 21:08:03,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-09-03 21:08:03,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:03,213 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:03,215 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:03,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash -783376379, now seen corresponding path program 1 times [2019-09-03 21:08:03,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:03,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:03,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:03,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:08:03,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-03 21:08:03,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:08:03,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-03 21:08:03,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-03 21:08:03,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:08:03,345 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-09-03 21:08:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:03,360 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-09-03 21:08:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-03 21:08:03,361 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-09-03 21:08:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:03,368 INFO L225 Difference]: With dead ends: 23 [2019-09-03 21:08:03,369 INFO L226 Difference]: Without dead ends: 18 [2019-09-03 21:08:03,371 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-03 21:08:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-03 21:08:03,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-03 21:08:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-03 21:08:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-09-03 21:08:03,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 11 [2019-09-03 21:08:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:03,408 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-09-03 21:08:03,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-03 21:08:03,409 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-09-03 21:08:03,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-03 21:08:03,409 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:03,410 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:03,410 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1238212304, now seen corresponding path program 1 times [2019-09-03 21:08:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:03,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:03,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:03,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:03,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:03,420 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:08:03,421 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:08:03,421 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:08:03,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:03,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:08:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:03,455 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2019-09-03 21:08:03,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:03,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:03,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:03,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:03,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:03,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:03,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:08:03,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:03,602 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:03,677 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:08:03,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2019-09-03 21:08:03,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:08:03,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-03 21:08:03,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-03 21:08:03,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-03 21:08:03,679 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-09-03 21:08:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:03,782 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2019-09-03 21:08:03,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:08:03,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-03 21:08:03,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:03,784 INFO L225 Difference]: With dead ends: 27 [2019-09-03 21:08:03,784 INFO L226 Difference]: Without dead ends: 26 [2019-09-03 21:08:03,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:08:03,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-03 21:08:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-03 21:08:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-03 21:08:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-09-03 21:08:03,792 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2019-09-03 21:08:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:03,793 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-09-03 21:08:03,793 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-03 21:08:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-09-03 21:08:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-03 21:08:03,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:03,794 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:03,795 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:03,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:03,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1076826781, now seen corresponding path program 1 times [2019-09-03 21:08:03,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:03,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:03,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:03,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:03,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:03,804 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:08:03,804 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:08:03,805 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:08:03,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:03,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:08:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:03,842 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2019-09-03 21:08:03,844 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [29], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64] [2019-09-03 21:08:03,884 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:08:03,884 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:08:03,984 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:08:03,986 INFO L272 AbstractInterpreter]: Visited 15 different actions 15 times. Never merged. Never widened. Performed 20 root evaluator evaluations with a maximum evaluation depth of 8. Performed 20 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Never found a fixpoint. Largest state had 7 variables. [2019-09-03 21:08:03,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:03,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:08:03,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:03,990 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:04,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:04,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:04,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-03 21:08:04,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:04,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:04,064 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-03 21:08:04,067 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-09-03 21:08:04,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-09-03 21:08:04,068 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-03 21:08:04,068 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-03 21:08:04,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-03 21:08:04,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:08:04,069 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-09-03 21:08:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:04,089 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2019-09-03 21:08:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-03 21:08:04,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-03 21:08:04,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:04,090 INFO L225 Difference]: With dead ends: 31 [2019-09-03 21:08:04,090 INFO L226 Difference]: Without dead ends: 28 [2019-09-03 21:08:04,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-03 21:08:04,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-03 21:08:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-03 21:08:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-03 21:08:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-09-03 21:08:04,096 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-09-03 21:08:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:04,096 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-09-03 21:08:04,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-03 21:08:04,097 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-09-03 21:08:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-03 21:08:04,097 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:04,098 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:04,098 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:04,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:04,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1643387496, now seen corresponding path program 1 times [2019-09-03 21:08:04,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:04,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:04,114 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:08:04,114 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:08:04,115 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:08:04,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:04,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:08:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:04,142 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2019-09-03 21:08:04,143 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [29], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64] [2019-09-03 21:08:04,145 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:08:04,145 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:08:04,204 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:08:04,209 INFO L272 AbstractInterpreter]: Visited 16 different actions 39 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 63 root evaluator evaluations with a maximum evaluation depth of 8. Performed 63 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 2 different actions. Largest state had 7 variables. [2019-09-03 21:08:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:04,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:08:04,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:04,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:04,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:04,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:08:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:04,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:08:04,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:08:04,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-03 21:08:04,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:08:04,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-09-03 21:08:04,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:04,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:08:04,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:08:04,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:08:04,435 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 9 states. [2019-09-03 21:08:04,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:04,550 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2019-09-03 21:08:04,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:08:04,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-09-03 21:08:04,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:04,552 INFO L225 Difference]: With dead ends: 36 [2019-09-03 21:08:04,552 INFO L226 Difference]: Without dead ends: 35 [2019-09-03 21:08:04,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-03 21:08:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-03 21:08:04,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-09-03 21:08:04,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-03 21:08:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-03 21:08:04,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2019-09-03 21:08:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:04,558 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-03 21:08:04,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:08:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-03 21:08:04,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-03 21:08:04,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:04,559 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:04,560 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:04,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:04,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1005474043, now seen corresponding path program 2 times [2019-09-03 21:08:04,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:04,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:08:04,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:04,569 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:08:04,569 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:08:04,570 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-03 21:08:04,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:04,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:08:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:04,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:04,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:04,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:04,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:04,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:08:04,619 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:08:04,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-03 21:08:04,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:04,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-03 21:08:04,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:04,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 21:08:04,685 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-03 21:08:04,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:08:04,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-03 21:08:04,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:04,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-03 21:08:04,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-03 21:08:04,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:08:04,771 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-03 21:08:04,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:08:04,820 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2019-09-03 21:08:04,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:08:04,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-09-03 21:08:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:08:04,822 INFO L225 Difference]: With dead ends: 47 [2019-09-03 21:08:04,822 INFO L226 Difference]: Without dead ends: 37 [2019-09-03 21:08:04,823 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-03 21:08:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-03 21:08:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-09-03 21:08:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-03 21:08:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-03 21:08:04,830 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 30 [2019-09-03 21:08:04,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:08:04,830 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-03 21:08:04,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-03 21:08:04,830 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-03 21:08:04,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-03 21:08:04,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:08:04,832 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:08:04,832 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:08:04,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:08:04,832 INFO L82 PathProgramCache]: Analyzing trace with hash 365642816, now seen corresponding path program 3 times [2019-09-03 21:08:04,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:08:04,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:04,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:08:04,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:08:04,841 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:08:04,842 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:08:04,842 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:08:04,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:08:04,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:08:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:08:04,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:08:04,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:08:04,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:08:04,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:08:04,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:08:04,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:08:04,927 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:08:04,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:08:04,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-03 21:08:04,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:08:05,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:05,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:05,649 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 29 [2019-09-03 21:08:05,688 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_main_~b~0_32 Int)) (let ((.cse1 (+ c_main_~b~0 c_main_~r~0)) (.cse0 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (<= .cse0 .cse1) (= (+ .cse1 (* (div (+ (* (- 1) c_main_~q~0) 1) (- 2)) v_main_~b~0_32)) c_main_~A~0) (= (div v_main_~b~0_32 2) c_main_~b~0) (< .cse1 v_main_~b~0_32) (= (mod .cse0 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))) (= (mod (+ c_main_~q~0 1) (- 2)) 0)) is different from false [2019-09-03 21:08:05,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:05,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:05,845 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (mod (+ (div (- c_main_~q~0) (- 2)) 1) (- 2)) 0)) (.cse1 (= (mod c_main_~q~0 (- 2)) 0))) (or (and .cse0 .cse1 (exists ((v_main_~b~0_32 Int)) (let ((.cse3 (div v_main_~b~0_32 2))) (let ((.cse2 (+ .cse3 c_main_~r~0)) (.cse4 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (< .cse2 v_main_~b~0_32) (= c_main_~b~0 (div .cse3 2)) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse2) c_main_~A~0) (<= .cse4 .cse2) (= (mod .cse3 2) 0) (= (mod .cse4 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2)))))))) (and .cse0 (exists ((v_main_~b~0_32 Int)) (let ((.cse6 (div v_main_~b~0_32 2))) (let ((.cse5 (+ .cse6 c_main_~r~0)) (.cse7 (div (- v_main_~b~0_32) (- 2)))) (and (<= 0 v_main_~b~0_32) (< .cse5 v_main_~b~0_32) (= c_main_~b~0 (div .cse6 2)) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse5) c_main_~A~0) (<= .cse7 .cse5) (= (mod .cse7 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2))) (<= 0 .cse6))))) .cse1) (and .cse0 (exists ((v_main_~b~0_32 Int)) (let ((.cse8 (div v_main_~b~0_32 2))) (let ((.cse9 (+ .cse8 c_main_~r~0)) (.cse10 (div (- v_main_~b~0_32) (- 2)))) (and (not (= (mod .cse8 2) 0)) (<= 0 v_main_~b~0_32) (< .cse9 v_main_~b~0_32) (= (+ (* (div (+ (* (- 1) (div (- c_main_~q~0) (- 2))) 1) (- 2)) v_main_~b~0_32) .cse9) c_main_~A~0) (<= .cse10 .cse9) (< .cse8 0) (= (mod .cse10 (- 2)) 0) (= 0 (mod v_main_~b~0_32 (- 2))) (= c_main_~b~0 (+ (div .cse8 2) 1)))))) .cse1))) is different from false [2019-09-03 21:08:18,550 WARN L188 SmtUtils]: Spent 12.63 s on a formula simplification. DAG size of input: 93 DAG size of output: 45 [2019-09-03 21:08:18,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:27,061 WARN L188 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 3 [2019-09-03 21:08:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2019-09-03 21:08:27,340 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:08:30,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:33,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:33,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:33,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:33,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:34,024 WARN L188 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-03 21:08:34,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-03 21:08:34,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:34,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:34,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:34,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:34,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:34,676 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 9 [2019-09-03 21:08:34,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:08:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-03 21:08:35,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:08:35,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-09-03 21:08:35,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:08:35,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-03 21:08:35,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-03 21:08:35,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=341, Unknown=12, NotChecked=78, Total=506 [2019-09-03 21:08:35,038 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 23 states. [2019-09-03 21:08:37,450 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 51 DAG size of output: 29 [2019-09-03 21:08:41,306 WARN L188 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 54 DAG size of output: 34 [2019-09-03 21:09:03,872 WARN L188 SmtUtils]: Spent 19.45 s on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2019-09-03 21:09:11,341 WARN L188 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-03 21:09:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:12,882 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2019-09-03 21:09:12,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 21:09:12,886 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-09-03 21:09:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:12,889 INFO L225 Difference]: With dead ends: 48 [2019-09-03 21:09:12,889 INFO L226 Difference]: Without dead ends: 48 [2019-09-03 21:09:12,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 61.0s TimeCoverageRelationStatistics Valid=121, Invalid=626, Unknown=17, NotChecked=106, Total=870 [2019-09-03 21:09:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-03 21:09:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-09-03 21:09:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-03 21:09:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2019-09-03 21:09:12,896 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2019-09-03 21:09:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:12,896 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2019-09-03 21:09:12,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-03 21:09:12,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2019-09-03 21:09:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-03 21:09:12,898 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:12,898 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:12,898 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:12,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:12,898 INFO L82 PathProgramCache]: Analyzing trace with hash 836866802, now seen corresponding path program 1 times [2019-09-03 21:09:12,899 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:12,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:12,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:12,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:12,906 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:12,907 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:12,907 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:09:12,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:12,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:12,936 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2019-09-03 21:09:12,937 INFO L207 CegarAbsIntRunner]: [0], [4], [13], [16], [18], [29], [33], [35], [38], [48], [51], [53], [56], [58], [59], [60], [61], [63], [64], [65] [2019-09-03 21:09:12,939 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-03 21:09:12,939 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-03 21:09:13,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-03 21:09:13,001 INFO L272 AbstractInterpreter]: Visited 16 different actions 39 times. Merged at 4 different actions 12 times. Widened at 1 different actions 1 times. Performed 63 root evaluator evaluations with a maximum evaluation depth of 8. Performed 63 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 2 different actions. Largest state had 7 variables. [2019-09-03 21:09:13,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:13,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-03 21:09:13,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:13,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:13,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:13,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:13,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-03 21:09:13,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:13,079 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 21:09:13,079 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:13,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-03 21:09:13,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:13,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-09-03 21:09:13,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:13,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-03 21:09:13,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-03 21:09:13,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-03 21:09:13,158 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 9 states. [2019-09-03 21:09:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:13,243 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-09-03 21:09:13,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:09:13,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-09-03 21:09:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:13,244 INFO L225 Difference]: With dead ends: 48 [2019-09-03 21:09:13,244 INFO L226 Difference]: Without dead ends: 43 [2019-09-03 21:09:13,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-03 21:09:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-03 21:09:13,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-03 21:09:13,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-03 21:09:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-03 21:09:13,250 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 38 [2019-09-03 21:09:13,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:13,250 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-03 21:09:13,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-03 21:09:13,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-03 21:09:13,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-03 21:09:13,252 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:13,252 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:13,252 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:13,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash 2054940077, now seen corresponding path program 4 times [2019-09-03 21:09:13,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:13,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:13,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:13,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:13,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:13,260 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:13,261 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:13,261 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-03 21:09:13,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:13,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:13,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:13,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:13,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:13,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:13,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:13,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:13,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-03 21:09:13,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:13,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 21:09:13,369 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:13,758 WARN L188 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-03 21:09:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 21:09:13,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:13,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-09-03 21:09:13,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:13,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-03 21:09:13,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-03 21:09:13,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:09:13,802 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 8 states. [2019-09-03 21:09:13,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:13,892 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2019-09-03 21:09:13,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-03 21:09:13,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-09-03 21:09:13,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:13,894 INFO L225 Difference]: With dead ends: 56 [2019-09-03 21:09:13,895 INFO L226 Difference]: Without dead ends: 45 [2019-09-03 21:09:13,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-03 21:09:13,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-03 21:09:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-03 21:09:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-03 21:09:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2019-09-03 21:09:13,901 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 40 [2019-09-03 21:09:13,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:13,901 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2019-09-03 21:09:13,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-03 21:09:13,901 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2019-09-03 21:09:13,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-03 21:09:13,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:13,902 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:13,903 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:13,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:13,903 INFO L82 PathProgramCache]: Analyzing trace with hash 632581416, now seen corresponding path program 5 times [2019-09-03 21:09:13,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:13,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:13,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:13,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:13,912 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:13,913 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:13,913 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:13,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:13,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:13,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:13,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:13,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:13,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:13,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:09:13,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:09:13,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-03 21:09:13,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:13,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-03 21:09:13,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:17,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:17,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-03 21:09:17,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:17,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:18,226 WARN L188 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-03 21:09:19,184 WARN L188 SmtUtils]: Spent 864.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-09-03 21:09:19,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:21,927 WARN L188 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-09-03 21:09:22,437 WARN L188 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 60 [2019-09-03 21:09:22,751 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (17)] Exception during sending of exit command (exit): Broken pipe [2019-09-03 21:09:22,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:22,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2019-09-03 21:09:22,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:22,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-03 21:09:22,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-03 21:09:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2019-09-03 21:09:22,760 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 25 states. [2019-09-03 21:09:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:35,445 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-09-03 21:09:35,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-03 21:09:35,445 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2019-09-03 21:09:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:35,447 INFO L225 Difference]: With dead ends: 64 [2019-09-03 21:09:35,447 INFO L226 Difference]: Without dead ends: 64 [2019-09-03 21:09:35,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=110, Invalid=538, Unknown=2, NotChecked=0, Total=650 [2019-09-03 21:09:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-03 21:09:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 53. [2019-09-03 21:09:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-03 21:09:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-09-03 21:09:35,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 42 [2019-09-03 21:09:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:35,456 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-09-03 21:09:35,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-03 21:09:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-09-03 21:09:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-03 21:09:35,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:35,458 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:35,458 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1597921643, now seen corresponding path program 6 times [2019-09-03 21:09:35,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:35,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:35,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:35,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:35,460 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:35,469 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:35,469 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:35,470 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:35,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:35,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:09:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:35,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:35,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:35,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:35,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:35,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:09:35,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:09:35,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:09:35,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:09:35,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-03 21:09:35,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 21:09:35,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:36,049 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-03 21:09:36,496 WARN L188 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-09-03 21:09:36,690 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 33 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 21:09:36,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:09:36,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-03 21:09:36,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:09:36,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-03 21:09:36,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-03 21:09:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-03 21:09:36,695 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 17 states. [2019-09-03 21:09:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:09:36,981 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2019-09-03 21:09:36,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:09:36,985 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 50 [2019-09-03 21:09:36,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:09:36,986 INFO L225 Difference]: With dead ends: 70 [2019-09-03 21:09:36,986 INFO L226 Difference]: Without dead ends: 55 [2019-09-03 21:09:36,987 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-09-03 21:09:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-03 21:09:36,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-03 21:09:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-03 21:09:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-09-03 21:09:36,992 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 50 [2019-09-03 21:09:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:09:36,993 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-09-03 21:09:36,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-03 21:09:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-09-03 21:09:36,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-03 21:09:36,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:09:36,995 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:09:36,995 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:09:36,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:09:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash -903917488, now seen corresponding path program 7 times [2019-09-03 21:09:36,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:09:36,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:36,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:09:36,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:09:36,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:09:37,003 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:09:37,003 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:09:37,003 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-03 21:09:37,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:09:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:37,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:09:37,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:09:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:09:37,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:09:37,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:09:37,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-03 21:09:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:09:37,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-03 21:09:37,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:09:37,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:37,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:40,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,362 WARN L188 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-03 21:09:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,522 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 21:09:41,523 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:09:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:42,226 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-03 21:09:43,010 WARN L188 SmtUtils]: Spent 638.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-03 21:09:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-03 21:09:43,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:43,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:43,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:43,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:43,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:09:46,447 WARN L188 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-09-03 21:09:47,851 WARN L188 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 100 [2019-09-03 21:09:47,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:02,168 WARN L188 SmtUtils]: Spent 13.88 s on a formula simplification. DAG size of input: 198 DAG size of output: 187 [2019-09-03 21:10:04,904 WARN L188 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 188 DAG size of output: 100 [2019-09-03 21:10:05,694 WARN L188 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 59 [2019-09-03 21:10:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 52 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-03 21:10:06,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:10:06,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2019-09-03 21:10:06,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:06,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-03 21:10:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-03 21:10:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=778, Unknown=2, NotChecked=0, Total=930 [2019-09-03 21:10:06,089 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 31 states. [2019-09-03 21:10:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:23,774 INFO L93 Difference]: Finished difference Result 81 states and 93 transitions. [2019-09-03 21:10:23,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-03 21:10:23,775 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 52 [2019-09-03 21:10:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:23,777 INFO L225 Difference]: With dead ends: 81 [2019-09-03 21:10:23,777 INFO L226 Difference]: Without dead ends: 81 [2019-09-03 21:10:23,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 28.9s TimeCoverageRelationStatistics Valid=171, Invalid=883, Unknown=2, NotChecked=0, Total=1056 [2019-09-03 21:10:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-09-03 21:10:23,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 63. [2019-09-03 21:10:23,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-03 21:10:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2019-09-03 21:10:23,791 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 52 [2019-09-03 21:10:23,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:23,791 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2019-09-03 21:10:23,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-03 21:10:23,791 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2019-09-03 21:10:23,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-03 21:10:23,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:23,793 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:23,793 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:23,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:23,793 INFO L82 PathProgramCache]: Analyzing trace with hash 340451773, now seen corresponding path program 8 times [2019-09-03 21:10:23,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:23,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:23,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-03 21:10:23,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:23,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:23,801 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:23,802 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:23,802 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:23,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:23,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:23,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:23,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:23,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:23,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:23,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:23,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-03 21:10:23,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-03 21:10:24,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-03 21:10:24,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:24,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-03 21:10:24,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:10:24,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:10:24,671 WARN L188 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-03 21:10:25,280 WARN L188 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 34 [2019-09-03 21:10:26,003 WARN L188 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 41 [2019-09-03 21:10:26,148 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-03 21:10:26,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:10:26,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-09-03 21:10:26,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:10:26,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-03 21:10:26,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-03 21:10:26,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-03 21:10:26,155 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 12 states. [2019-09-03 21:10:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-03 21:10:26,421 INFO L93 Difference]: Finished difference Result 84 states and 97 transitions. [2019-09-03 21:10:26,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-03 21:10:26,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-09-03 21:10:26,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-03 21:10:26,425 INFO L225 Difference]: With dead ends: 84 [2019-09-03 21:10:26,425 INFO L226 Difference]: Without dead ends: 65 [2019-09-03 21:10:26,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-03 21:10:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-09-03 21:10:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-09-03 21:10:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-03 21:10:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2019-09-03 21:10:26,435 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 60 [2019-09-03 21:10:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-03 21:10:26,435 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2019-09-03 21:10:26,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-03 21:10:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2019-09-03 21:10:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-03 21:10:26,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-03 21:10:26,437 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-03 21:10:26,437 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-03 21:10:26,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-03 21:10:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1434985032, now seen corresponding path program 9 times [2019-09-03 21:10:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-03 21:10:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:26,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:26,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-03 21:10:26,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-03 21:10:26,445 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-03 21:10:26,445 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-03 21:10:26,445 INFO L170 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-09-03 21:10:26,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-03 21:10:26,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2019-09-03 21:10:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-03 21:10:26,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-03 21:10:26,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-03 21:10:26,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-03 21:10:26,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-03 21:10:26,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-03 21:10:26,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-03 21:10:26,539 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-03 21:10:26,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-03 21:10:26,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 63 conjunts are in the unsatisfiable core [2019-09-03 21:10:26,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-03 21:10:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:27,126 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 (mod c_main_~q~0 2)))) (or (and .cse0 (exists ((v_main_~b~0_120 Int)) (let ((.cse3 (div (- v_main_~b~0_120) (- 2)))) (let ((.cse2 (div (- .cse3) (- 2)))) (let ((.cse1 (div (- .cse2) (- 2)))) (and (= 0 (mod (div (- .cse1) (- 2)) (- 2))) (= 0 (mod .cse2 (- 2))) (< c_main_~r~0 v_main_~b~0_120) (= c_main_~b~0 (div v_main_~b~0_120 2)) (= 0 (mod .cse1 (- 2))) (<= .cse3 c_main_~r~0) (= c_main_~A~0 (+ c_main_~r~0 (* v_main_~b~0_120 (div c_main_~q~0 2)))) (= (mod v_main_~b~0_120 (- 2)) 0) (<= 0 v_main_~b~0_120) (= (mod .cse3 (- 2)) 0))))))) (and .cse0 (exists ((v_main_~b~0_120 Int)) (let ((.cse6 (div (- v_main_~b~0_120) (- 2)))) (let ((.cse5 (div (- .cse6) (- 2)))) (let ((.cse4 (div (- .cse5) (- 2)))) (and (= 0 (mod (div (- .cse4) (- 2)) (- 2))) (= 0 (mod .cse5 (- 2))) (< c_main_~r~0 v_main_~b~0_120) (= c_main_~b~0 (div v_main_~b~0_120 2)) (= 0 (mod v_main_~b~0_120 2)) (= 0 (mod .cse4 (- 2))) (<= .cse6 c_main_~r~0) (= c_main_~A~0 (+ c_main_~r~0 (* v_main_~b~0_120 (div c_main_~q~0 2)))) (= (mod v_main_~b~0_120 (- 2)) 0) (= (mod .cse6 (- 2)) 0))))))) (and .cse0 (exists ((v_main_~b~0_120 Int)) (let ((.cse9 (div (- v_main_~b~0_120) (- 2)))) (let ((.cse8 (div (- .cse9) (- 2)))) (let ((.cse7 (div (- .cse8) (- 2)))) (and (= 0 (mod (div (- .cse7) (- 2)) (- 2))) (= 0 (mod .cse8 (- 2))) (< c_main_~r~0 v_main_~b~0_120) (= 0 (mod .cse7 (- 2))) (<= .cse9 c_main_~r~0) (= c_main_~A~0 (+ c_main_~r~0 (* v_main_~b~0_120 (div c_main_~q~0 2)))) (= (mod v_main_~b~0_120 (- 2)) 0) (< v_main_~b~0_120 0) (= (+ (div v_main_~b~0_120 2) 1) c_main_~b~0) (not (= 0 (mod v_main_~b~0_120 2))) (= (mod .cse9 (- 2)) 0))))))))) is different from false [2019-09-03 21:10:27,444 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 (mod (+ c_main_~q~0 1) 2)))) (or (and .cse0 (exists ((v_prenex_3 Int)) (let ((.cse4 (div (- v_prenex_3) (- 2)))) (let ((.cse1 (div (- .cse4) (- 2)))) (let ((.cse2 (div (- .cse1) (- 2))) (.cse3 (+ c_main_~b~0 c_main_~r~0))) (and (= (mod v_prenex_3 (- 2)) 0) (= 0 (mod .cse1 (- 2))) (= 0 (mod .cse2 (- 2))) (< .cse3 v_prenex_3) (<= .cse4 .cse3) (= 0 (mod (div (- .cse2) (- 2)) (- 2))) (< v_prenex_3 0) (= (+ (div v_prenex_3 2) 1) c_main_~b~0) (= c_main_~A~0 (+ .cse3 (* (div (+ c_main_~q~0 (- 1)) 2) v_prenex_3))) (= (mod .cse4 (- 2)) 0) (not (= 0 (mod v_prenex_3 2))))))))) (and .cse0 (exists ((v_main_~b~0_120 Int)) (let ((.cse8 (div (- v_main_~b~0_120) (- 2)))) (let ((.cse7 (div (- .cse8) (- 2)))) (let ((.cse6 (div (- .cse7) (- 2))) (.cse5 (+ c_main_~b~0 c_main_~r~0))) (and (< .cse5 v_main_~b~0_120) (= (+ .cse5 (* v_main_~b~0_120 (div (+ c_main_~q~0 (- 1)) 2))) c_main_~A~0) (= 0 (mod (div (- .cse6) (- 2)) (- 2))) (= 0 (mod .cse7 (- 2))) (= c_main_~b~0 (div v_main_~b~0_120 2)) (= 0 (mod .cse6 (- 2))) (= (mod v_main_~b~0_120 (- 2)) 0) (<= .cse8 .cse5) (<= 0 v_main_~b~0_120) (= (mod .cse8 (- 2)) 0))))))) (and .cse0 (exists ((v_prenex_4 Int)) (let ((.cse12 (div (- v_prenex_4) (- 2)))) (let ((.cse11 (div (- .cse12) (- 2)))) (let ((.cse10 (div (- .cse11) (- 2))) (.cse9 (+ c_main_~b~0 c_main_~r~0))) (and (< .cse9 v_prenex_4) (= 0 (mod v_prenex_4 2)) (= 0 (mod .cse10 (- 2))) (= 0 (mod (div (- .cse10) (- 2)) (- 2))) (= 0 (mod .cse11 (- 2))) (= c_main_~A~0 (+ .cse9 (* (div (+ c_main_~q~0 (- 1)) 2) v_prenex_4))) (= c_main_~b~0 (div v_prenex_4 2)) (= (mod .cse12 (- 2)) 0) (<= .cse12 .cse9) (= (mod v_prenex_4 (- 2)) 0))))))))) is different from false [2019-09-03 21:10:27,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:27,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:10:27,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:27,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:27,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:10:27,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-03 21:11:03,503 WARN L188 SmtUtils]: Spent 27.22 s on a formula simplification. DAG size of input: 158 DAG size of output: 52 [2019-09-03 21:11:03,766 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (mod (+ c_main_~q~0 1) 2)) (exists ((v_prenex_4 Int)) (let ((.cse3 (div (- v_prenex_4) (- 2)))) (let ((.cse2 (div v_prenex_4 2)) (.cse4 (div (- .cse3) (- 2)))) (let ((.cse1 (div (- .cse4) (- 2))) (.cse0 (+ .cse2 c_main_~b~0 c_main_~r~0))) (and (= c_main_~A~0 (+ (* (div (+ (div (+ c_main_~q~0 (- 1)) 2) (- 1)) 2) v_prenex_4) .cse0)) (= 0 (mod v_prenex_4 2)) (< .cse0 v_prenex_4) (= 0 (mod .cse1 (- 2))) (= (mod .cse2 2) 0) (= 0 (mod (div (- .cse1) (- 2)) (- 2))) (<= .cse3 .cse0) (= 0 (mod .cse4 (- 2))) (= (div .cse2 2) c_main_~b~0) (= (mod .cse3 (- 2)) 0) (= (mod v_prenex_4 (- 2)) 0)))))) (= 0 (mod (+ (div (+ c_main_~q~0 (- 1)) 2) 1) 2))) is different from false [2019-09-03 21:11:04,169 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-09-03 21:11:04,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:04,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:21,617 WARN L188 SmtUtils]: Spent 13.25 s on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-09-03 21:11:21,905 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (div (+ c_main_~q~0 (- 1)) 2))) (and (= 0 (mod (+ c_main_~q~0 1) 2)) (exists ((v_prenex_4 Int)) (let ((.cse4 (div v_prenex_4 2)) (.cse1 (div (- v_prenex_4) (- 2)))) (let ((.cse5 (div (- .cse1) (- 2))) (.cse2 (div .cse4 2))) (let ((.cse0 (+ .cse4 .cse2 c_main_~r~0 c_main_~b~0)) (.cse3 (div (- .cse5) (- 2)))) (and (< .cse0 v_prenex_4) (<= .cse1 .cse0) (= 0 (mod v_prenex_4 2)) (= c_main_~b~0 (div .cse2 2)) (= 0 (mod .cse3 (- 2))) (= 0 (mod .cse2 2)) (= (mod .cse4 2) 0) (= 0 (mod (div (- .cse3) (- 2)) (- 2))) (= c_main_~A~0 (+ (* (div (+ (div (+ (div (+ c_main_~q~0 (- 1)) 2) (- 1)) 2) (- 1)) 2) v_prenex_4) (+ .cse4 .cse2 c_main_~b~0 c_main_~r~0))) (= 0 (mod .cse5 (- 2))) (= (mod .cse1 (- 2)) 0) (= (mod v_prenex_4 (- 2)) 0)))))) (= 0 (mod (+ .cse6 1) 2)) (= 0 (mod (+ (div (+ .cse6 (- 1)) 2) 1) 2)))) is different from false [2019-09-03 21:11:22,365 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-09-03 21:11:22,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:22,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:22,713 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse25 (div (- c_main_~q~0) (- 2)))) (let ((.cse26 (div (+ .cse25 (- 1)) 2))) (let ((.cse0 (= (mod (+ (div (+ .cse26 (- 1)) 2) 1) 2) 0)) (.cse1 (= (mod (+ .cse26 1) 2) 0)) (.cse2 (= (mod (+ .cse25 1) 2) 0)) (.cse3 (= (mod c_main_~q~0 (- 2)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_4 Int)) (let ((.cse10 (div v_prenex_4 2))) (let ((.cse6 (div .cse10 2)) (.cse4 (div (- v_prenex_4) (- 2)))) (let ((.cse8 (div (- .cse4) (- 2))) (.cse9 (div .cse6 2))) (let ((.cse5 (+ .cse10 .cse6 c_main_~r~0 .cse9)) (.cse7 (div (- .cse8) (- 2)))) (and (<= .cse4 .cse5) (= 0 (mod v_prenex_4 2)) (= c_main_~A~0 (+ .cse5 (* (div (+ (div (+ (div (+ (div (- c_main_~q~0) (- 2)) (- 1)) 2) (- 1)) 2) (- 1)) 2) v_prenex_4))) (= 0 (mod .cse6 2)) (= 0 (mod (div (- .cse7) (- 2)) (- 2))) (= 0 (mod .cse8 (- 2))) (< .cse5 v_prenex_4) (= (mod v_prenex_4 (- 2)) 0) (= c_main_~b~0 (div .cse9 2)) (= (mod .cse9 2) 0) (= 0 (mod .cse7 (- 2))) (= (mod .cse10 2) 0) (= (mod .cse4 (- 2)) 0)))))))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_4 Int)) (let ((.cse17 (div v_prenex_4 2))) (let ((.cse13 (div .cse17 2)) (.cse11 (div (- v_prenex_4) (- 2)))) (let ((.cse15 (div (- .cse11) (- 2))) (.cse16 (div .cse13 2))) (let ((.cse12 (+ .cse17 .cse13 c_main_~r~0 .cse16)) (.cse14 (div (- .cse15) (- 2)))) (and (<= .cse11 .cse12) (= 0 (mod v_prenex_4 2)) (= c_main_~A~0 (+ .cse12 (* (div (+ (div (+ (div (+ (div (- c_main_~q~0) (- 2)) (- 1)) 2) (- 1)) 2) (- 1)) 2) v_prenex_4))) (= 0 (mod .cse13 2)) (= 0 (mod (div (- .cse14) (- 2)) (- 2))) (= 0 (mod .cse15 (- 2))) (< .cse12 v_prenex_4) (= (mod v_prenex_4 (- 2)) 0) (= c_main_~b~0 (div .cse16 2)) (<= 0 .cse16) (= 0 (mod .cse14 (- 2))) (= (mod .cse17 2) 0) (= (mod .cse11 (- 2)) 0)))))))) (and .cse0 .cse1 .cse2 .cse3 (exists ((v_prenex_4 Int)) (let ((.cse24 (div v_prenex_4 2))) (let ((.cse21 (div .cse24 2)) (.cse19 (div (- v_prenex_4) (- 2)))) (let ((.cse23 (div (- .cse19) (- 2))) (.cse18 (div .cse21 2))) (let ((.cse20 (+ .cse24 .cse21 c_main_~r~0 .cse18)) (.cse22 (div (- .cse23) (- 2)))) (and (< .cse18 0) (<= .cse19 .cse20) (= 0 (mod v_prenex_4 2)) (= c_main_~A~0 (+ .cse20 (* (div (+ (div (+ (div (+ (div (- c_main_~q~0) (- 2)) (- 1)) 2) (- 1)) 2) (- 1)) 2) v_prenex_4))) (= 0 (mod .cse21 2)) (= 0 (mod (div (- .cse22) (- 2)) (- 2))) (= 0 (mod .cse23 (- 2))) (< .cse20 v_prenex_4) (= c_main_~b~0 (+ (div .cse18 2) 1)) (not (= (mod .cse18 2) 0)) (= (mod v_prenex_4 (- 2)) 0) (= 0 (mod .cse22 (- 2))) (= (mod .cse24 2) 0) (= (mod .cse19 (- 2)) 0)))))))))))) is different from false [2019-09-03 21:11:42,180 WARN L188 SmtUtils]: Spent 17.72 s on a formula simplification. DAG size of input: 166 DAG size of output: 78 [2019-09-03 21:11:42,684 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-09-03 21:11:42,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:42,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:11:51,139 WARN L188 SmtUtils]: Spent 6.94 s on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-09-03 21:11:55,298 WARN L188 SmtUtils]: Spent 3.68 s on a formula simplification that was a NOOP. DAG size: 78 [2019-09-03 21:11:55,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:01,659 WARN L838 $PredicateComparison]: unable to prove that (or (= |c___VERIFIER_assert_#in~cond| 1) (and (= |c___VERIFIER_assert_#in~cond| 0) (exists ((v_prenex_10 Int) (v_main_~r~0_BEFORE_CALL_33 Int) (v_main_~q~0_BEFORE_CALL_31 Int)) (let ((.cse0 (div v_prenex_10 2))) (let ((.cse9 (div .cse0 2))) (let ((.cse1 (div (+ v_main_~q~0_BEFORE_CALL_31 (- 1)) 2)) (.cse2 (div .cse9 2))) (let ((.cse11 (div (- v_prenex_10) (- 2))) (.cse12 (div .cse2 2)) (.cse4 (div (+ (* (- 1) .cse1) 1) (- 2)))) (let ((.cse3 (div (+ .cse4 (- 1)) 2)) (.cse5 (div .cse12 2)) (.cse8 (div (- .cse11) (- 2)))) (let ((.cse10 (div (- .cse8) (- 2))) (.cse7 (+ .cse2 .cse9 .cse0 .cse5 v_main_~r~0_BEFORE_CALL_33 .cse12)) (.cse6 (div (+ .cse3 (- 1)) 2))) (and (= (mod .cse0 2) 0) (= 0 (mod v_prenex_10 2)) (= (mod (+ .cse1 1) (- 2)) 0) (<= 0 .cse2) (= (mod (+ .cse3 1) 2) 0) (= 0 (mod (+ .cse4 1) 2)) (not (= (+ v_main_~r~0_BEFORE_CALL_33 (* v_main_~q~0_BEFORE_CALL_31 .cse5)) (+ (* (div (+ .cse6 (- 1)) 2) v_prenex_10) .cse7))) (= 0 (mod .cse8 (- 2))) (= (mod v_prenex_10 (- 2)) 0) (< .cse7 v_prenex_10) (= 0 (mod .cse9 2)) (= 0 (mod (div (- .cse10) (- 2)) (- 2))) (= 0 (mod .cse10 (- 2))) (<= .cse11 .cse7) (= 0 (mod (+ v_main_~q~0_BEFORE_CALL_31 1) 2)) (= 0 (mod (+ .cse6 1) 2)) (<= 0 .cse12) (= (mod .cse11 (- 2)) 0))))))))))) is different from false [2019-09-03 21:12:24,358 WARN L188 SmtUtils]: Spent 17.48 s on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-09-03 21:12:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 39 proven. 22 refuted. 1 times theorem prover too weak. 28 trivial. 40 not checked. [2019-09-03 21:12:29,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-03 21:12:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:52,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:52,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:12:52,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:00,733 WARN L188 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-09-03 21:13:07,058 WARN L188 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-09-03 21:13:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-03 21:13:07,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:07,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:13,643 WARN L188 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 105 DAG size of output: 95 [2019-09-03 21:13:17,789 WARN L188 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 96 [2019-09-03 21:13:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 9 terms [2019-09-03 21:13:17,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:17,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:34,037 WARN L188 SmtUtils]: Spent 10.67 s on a formula simplification. DAG size of input: 186 DAG size of output: 181 [2019-09-03 21:13:46,165 WARN L188 SmtUtils]: Spent 6.29 s on a formula simplification that was a NOOP. DAG size: 182 [2019-09-03 21:13:46,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 17 terms [2019-09-03 21:13:46,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:13:46,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,205 WARN L188 SmtUtils]: Spent 1.45 m on a formula simplification. DAG size of input: 369 DAG size of output: 344 [2019-09-03 21:15:17,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 33 terms [2019-09-03 21:15:17,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:17,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:15:25,104 WARN L188 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 414 DAG size of output: 25 [2019-09-03 21:15:25,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-03 21:16:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 19 proven. 71 refuted. 12 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-03 21:16:18,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-03 21:16:18,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2019-09-03 21:16:18,350 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-03 21:16:18,350 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-03 21:16:18,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-03 21:16:18,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=978, Unknown=76, NotChecked=426, Total=1640 [2019-09-03 21:16:18,351 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 41 states. [2019-09-03 21:16:32,165 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2019-09-03 21:16:45,366 WARN L188 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 44 [2019-09-03 21:16:53,850 WARN L188 SmtUtils]: Spent 4.08 s on a formula simplification that was a NOOP. DAG size: 67 [2019-09-03 21:17:03,300 WARN L188 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 51 DAG size of output: 24 [2019-09-03 21:17:14,654 WARN L188 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-09-03 21:17:51,496 WARN L188 SmtUtils]: Spent 12.29 s on a formula simplification. DAG size of input: 494 DAG size of output: 54 [2019-09-03 21:18:13,543 WARN L188 SmtUtils]: Spent 10.58 s on a formula simplification. DAG size of input: 507 DAG size of output: 46 [2019-09-03 21:18:26,208 WARN L188 SmtUtils]: Spent 9.03 s on a formula simplification. DAG size of input: 560 DAG size of output: 46 [2019-09-03 21:18:55,079 WARN L188 SmtUtils]: Spent 11.05 s on a formula simplification. DAG size of input: 174 DAG size of output: 52 [2019-09-03 21:19:10,025 WARN L188 SmtUtils]: Spent 10.92 s on a formula simplification. DAG size of input: 279 DAG size of output: 65 [2019-09-03 21:19:36,197 WARN L188 SmtUtils]: Spent 7.68 s on a formula simplification. DAG size of input: 254 DAG size of output: 54 [2019-09-03 21:20:02,295 WARN L188 SmtUtils]: Spent 10.90 s on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2019-09-03 21:20:16,659 WARN L188 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 118 DAG size of output: 58 [2019-09-03 21:20:50,280 WARN L188 SmtUtils]: Spent 15.03 s on a formula simplification. DAG size of input: 182 DAG size of output: 65 [2019-09-03 21:21:32,280 WARN L188 SmtUtils]: Spent 22.02 s on a formula simplification. DAG size of input: 156 DAG size of output: 62 [2019-09-03 21:21:47,997 WARN L188 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 17 [2019-09-03 21:22:37,060 WARN L188 SmtUtils]: Spent 34.91 s on a formula simplification. DAG size of input: 115 DAG size of output: 72